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: "external memory bwt and lcp computation for sequence collections with applications"
  Abstract: We propose an external memory algorithm for the computation of the BWT and LCP array for a collection of sequences. Our algorithm takes the amount of available memory as an input parameter, and tries to make the best use of it by splitting the input collection into subcollections sufficiently small that it can compute their BWT in RAM using an optimal linear time algorithm. Next, it merges the partial BWTs in external memory and in the process it also computes the LCP values. We prove that our algorithm performs O(n AveLcp) sequential I/Os, where n is the total length of the collection, and AveLcp is the average Longest Common Prefix of the collection. This bound is an improvement over the known algorithms for the same task. The experimental results show that our algorithm outperforms the current best algorithm for collections of sequences with different lengths and for collections with relatively small average Longest Common Prefix. #R##N#In the second part of the paper, we show that our algorithm can be modified to output two additional arrays that, used with the BWT and LCP arrays, provide simple, scan based, external memory algorithms for three well known problems in bioinformatics: the computation of maximal repeats, the all pairs suffix-prefix overlaps, and the construction of succinct de Bruijn graphs. To our knowledge, there are no other known external memory algorithms for these problems.

Connected through hyperedge HE-1 (induced by source paper "the alternating bwt an algorithmic perspective"):
  with members:
    - "a new class of searchable and provably highly compressible string transformations"
    - "on generalized lyndon words"
    - "lightweight lcp construction for very large collections of strings"
    - "large scale compression of genomic sequence databases with the burrows wheeler transform"
    - "optimal lower and upper bounds for representing sequences"
    - "on optimally partitioning a text to improve its compression"
    - "a note on the burrows wheeler transformation"

Connected through hyperedge HE-2 (induced by source paper "space efficient construction of compressed suffix trees"):
  with members:
    - "space efficient computation of the lcp array from the burrows wheeler transform"
    - "detecting mutations by ebwt"
    - "linear time string indexing and analysis in small space"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "lightweight lcp construction for very large collections of strings"
    - "linear time construction of compressed text indices in compact space"
    - "optimal dynamic sequence representations"

Connected through hyperedge HE-3 (induced by source paper "lightweight merging of compressed indices based on bwt variants"):
  with members:
    - "space efficient merging of succinct de bruijn graphs"
    - "indexing variation graphs"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "lightweight lcp construction for very large collections of strings"
    - "burrows wheeler transform for terabases"
    - "linear time construction of compressed text indices in compact space"
    - "variable order de bruijn graphs"

Connected through hyperedge HE-4 (induced by source paper "space efficient merging of succinct de bruijn graphs"):
  with members:
    - "lightweight merging of compressed indices based on bwt variants"
    - "variable order de bruijn graphs"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-5 (induced by source paper "a simple algorithm for computing the document array"):
  with members:
    - "algorithms to compute the burrows wheeler similarity distribution"
    - "haplotype aware graph indexes"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "document retrieval on repetitive string collections"
    - "from theory to practice plug and play with succinct data structures"

Connected through hyperedge HE-6 (induced by source paper "the colored longest common prefix array computed via sequential scans"):
  with members:
    - "fast label extraction in the cdawg"
    - "lightweight lcp construction for very large collections of strings"

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)