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 "burrows wheeler transform and lcp array construction in constant space"):
  Abstract: Abstract   In this article we extend the elegant in-place Burrows–Wheeler transform (BWT) algorithm proposed by Crochemore et al.  [12] . Our extension is twofold: we first show how to compute simultaneously the longest common prefix (LCP) array as well as the BWT, using constant additional space; we then show how to build the LCP array directly in compressed representation using Elias coding, still using constant additional space and with no asymptotic slowdown. Furthermore, we provide a time/space tradeoff for our algorithm when additional memory is allowed. Our algorithm runs in quadratic time, as does Crochemore et al.'s, and is supported by interesting properties of the BWT and of the LCP array, contributing to our understanding of the time/space tradeoff curve for building indexing structures.

Includes members:
  Member "linear time string indexing and analysis in small space":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fully functional bidirectional burrows wheeler indexes")
  Member "low space external memory construction of the succinct permuted longest common prefix array":
    also connected through other hyperedges:
      (none)
  Member "faster average case low memory semi external construction of the burrows wheeler transform":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low space external memory construction of the succinct permuted longest common prefix array")
  Member "space efficient construction of compressed indexes in deterministic linear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of bwt runs minimization via alphabet reordering")
  Member "in place longest common extensions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lightweight fingerprints for fast approximate keyword matching using bitwise operations")
  Member "lightweight lcp construction for very large collections of strings":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the alternating bwt an algorithmic perspective")
  Member "linear time construction of compressed text indices in compact space":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the complexity of bwt runs minimization via alphabet reordering")
  Member "lightweight lcp construction for next generation sequencing datasets":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fsg fast string graph construction for de novo assembly of reads data")

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)