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 "space efficient merging of succinct de bruijn graphs"):
  Abstract: We propose a new algorithm for merging succinct representations of de Bruijn graphs introduced in [Bowe et al. WABI 2012]. Our algorithm is inspired by the approach introduced by Holt and McMillan [Bionformatics 2014, ACM-BCB 2014] for merging Burrow-Wheeler transforms. In addition to its input, our algorithm uses only four bitvectors of working space and all data is accessed sequentially making the algorithm suitable for external memory execution. Our algorithm can also merge Colored succinct de Bruijn graphs, and can compute the Variable Order succinct representation from the plain representation of the input graphs. #R##N#Combining our merging algorithm with recent results on de Bruijn graph construction, we provide a space efficient procedure for building succinct representations of de Bruijn graphs for very large collections.

Includes members:
  Member "lightweight merging of compressed indices based on bwt variants":
    also connected through other hyperedges:
      (none)
  Member "external memory bwt and lcp computation for sequence collections with applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the alternating bwt an algorithmic perspective")
  Member "variable order de bruijn graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fully functional bidirectional burrows wheeler indexes")
  Member "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "path query data structures in practice")

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)