human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "inducing the lcp array"
  Abstract: We show how to modify the linear-time construction algorithm for suffix arrays based on induced sorting (Nong et al., DCC'09) such that it computes the array of longest common prefixes (LCP-array) as well. Practical tests show that this outperforms recent LCP-array construction algorithms (Gog and Ohlebusch, ALENEX'11).

Connected through hyperedge HE-1 (induced by source paper "inducing the lyndon array"):
  with members:
    - "lyndon array construction during burrows wheeler inversion"
    - "the runs theorem"
    - "algorithms to compute the lyndon array"
    - "simpler and faster lempel ziv factorization"

Connected through hyperedge HE-2 (induced by source paper "alignment free sequence comparison using absent words"):
  with members:
    - "indexing weighted sequences neat and efficient"
    - "minimal forbidden factors of circular words"
    - "linear time sequence comparison using minimal absent words applications"
    - "linear time computation of minimal absent words using suffix array"

Connected through hyperedge HE-3 (induced by source paper "longest common prefixes with k errors and applications"):
  with members:
    - "a note on the longest common substring with k mismatches problem"

Connected through hyperedge HE-4 (induced by source paper "burrows wheeler transform and lcp array construction in constant space"):
  with members:
    - "linear time string indexing and analysis in small space"
    - "low space external memory construction of the succinct permuted longest common prefix array"
    - "faster average case low memory semi external construction of the burrows wheeler transform"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "in place longest common extensions"
    - "lightweight lcp construction for very large collections of strings"
    - "linear time construction of compressed text indices in compact space"
    - "lightweight lcp construction for next generation sequencing datasets"

Connected through hyperedge HE-5 (induced by source paper "faster algorithms for 1 mappability of a sequence"):
  with members:
    - "linear time algorithm for long lcf with k mismatches"
    - "efficient computation of sequence mappability"
    - "longest common prefixes with k errors and applications"
    - "on the benefit of merging suffix array intervals for parallel pattern matching"

Connected through hyperedge HE-6 (induced by source paper "a grammar compression algorithm based on induced suffix sorting"):
  with members:
    - "from theory to practice plug and play with succinct data structures"
    - "linear time lempel ziv factorization simple fast small"
    - "improved grammar based compressed indexes"

Connected through hyperedge HE-7 (induced by source paper "in place longest common extensions"):
  with members:
    - "small space encoding lce data structure with constant time queries"
    - "burrows wheeler transform and lcp array construction in constant space"
    - "optimal time and space construction of suffix arrays and lcp arrays for integer alphabets"
    - "fast longest common extensions in small space"
    - "optimal in place suffix sorting"
    - "tight lower bounds for the longest common extension problem"
    - "dynamic index lz factorization and lce queries in compressed space"
    - "longest common extensions in sublinear space"

Connected through hyperedge HE-8 (induced by source paper "longest common subsequence in at least k length order isomorphic substrings"):
  with members:
    - "lcsk practical similarity metric for long strings"
    - "longest common subsequence in k length substrings"
    - "order preserving matching"
    - "efficient algorithms for the longest common subsequence in k length substrings"

Question: Please tell me which class the center node 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)