human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "longest common subsequence in at least k length order isomorphic substrings"):
  Abstract: We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least $k$ length substrings. First, we show an $O(mn)$ time algorithm for the problem which gives a better worst-case running time than existing algorithms, where $m$ and $n$ are lengths of the input strings. Furthermore, we mainly consider the LCS in at least $k$ length order-isomorphic substrings problem. We show that the problem can also be solved in $O(mn)$ worst-case time by an easy-to-implement algorithm.

Includes members:
  Member "lcsk practical similarity metric for long strings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast and simple algorithms for computing both lcs_ k and lcs_ k")
  Member "longest common subsequence in k length substrings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lcsk practical similarity metric for long strings")
  Member "order preserving matching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast multiple pattern cartesian tree matching")
  Member "efficient algorithms for the longest common subsequence in k length substrings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fast and simple algorithms for computing both lcs_ k and lcs_ k")
  Member "inducing the lcp array":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "inducing the lyndon array")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DS(Data Structures and Algorithms)