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 "streaming k mismatch with error correcting and applications"):
  Abstract: We present a new streaming algorithm for the $k$-Mismatch problem, one of the most basic problems in pattern matching. Given a pattern and a text, the task is to find all substrings of the text that are at the Hamming distance at most $k$ from the pattern. Our algorithm is enhanced with an important new feature called Error Correcting, and its complexities for $k=1$ and for a general $k$ match those of the best known solutions for the $k$-Mismatch problem from FOCS 2009 and SODA 2016. As a corollary we develop a series of streaming algorithms for pattern matching on weighted strings, which are a commonly used representation of uncertain sequences in molecular biology.

Includes members:
  Member "the streaming k mismatch problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximating text to pattern hamming distances")
  Member "indexing weighted sequences neat and efficient":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "experimental evaluation of algorithms for computing quasiperiods")
  Member "pattern matching and consensus problems on weighted sequences and profiles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "weighted shortest common supersequence problem revisited")
  Member "efficient index for weighted sequences":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "experimental evaluation of algorithms for computing quasiperiods")
  Member "approximate hamming distance in a stream":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximating text to pattern hamming distances")
  Member "dictionary matching in a stream":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sliding window property testing for regular languages")
  Member "the k mismatch problem revisited":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximating text to pattern hamming distances")
  Member "probabilistic threshold indexing for uncertain strings":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "indexing weighted sequences neat and efficient")

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)