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: "indexes of large genome collections on a pc"
  Abstract: The availability of thousands of individual genomes of one species should boost rapid progress in personalized medicine or understanding of the interaction between genotype and phenotype, to name a few applications. A key operation useful in such analyses is aligning sequencing reads against a collection of genomes, which is costly with the use of existing algorithms due to their large memory requirements. We present MuGI, Multiple Genome Index, which reports all occurrences of a given pattern, in exact and approximate matching model, against a collection of thousand(s) genomes. Its unique feature is the small index size, which is customisable. It fits in a standard computer with 16–32 GB, or even 8 GB, of RAM, for the 1000GP collection of 1092 diploid human genomes. The solution is also fast. For example, the exact matching queries (of average length 150 bp) are handled in average time of 39 µs and with up to 3 mismatches in 373 µs on the test PC with the index size of 13.4 GB. For a smaller index, occupying 7.4 GB in memory, the respective times grow to 76 µs and 917 µs. Software is available at http://sun.aei.polsl.pl/mugi under a free license. Data S1 is available at PLOS One online.

Connected through hyperedge HE-1 (induced by source paper "efficient construction of a complete index for pan genomics read alignment"):
  with members:
    - "prefix free parsing for building big bwts"
    - "optimal time text indexing in bwt runs bounded space"
    - "kmc 2 fast and resource frugal k mer counting"
    - "searching and indexing genomic databases via kernelization"
    - "hybrid indexes for repetitive datasets"

Connected through hyperedge HE-2 (induced by source paper "indexing variation graphs"):
  with members:
    - "read mapping on de bruijn graphs"
    - "fm index of alignment with gaps"

Connected through hyperedge HE-3 (induced by source paper "indexing arbitrary length k mers in sequencing reads"):
  with members:
    - "sampling the suffix array with minimizers"

Connected through hyperedge HE-4 (induced by source paper "searching and indexing genomic databases via kernelization"):
  with members:
    - "fully online grammar compression in constant space"
    - "hybrid indexes for repetitive datasets"
    - "improved esp index a practical self index for highly repetitive texts"
    - "data structure lower bounds on random access to grammar compressed strings"
    - "faster approximate pattern matching in compressed repetitive texts"
    - "improved grammar based compressed indexes"
    - "random access to grammar compressed 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.CE(Computational Engineering, Finance, and Science)