Real-time string matching in sublinear space

Leszek Ga̧sieniec, Roman Kolpakov

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Scopus citations

Abstract

We study a problem of efficient utilisation of extra memory space in real-time string matching. We propose, for any constant ε > 0, a real-time string matching algorithm claiming O(mε) extra space, where m is the size of a pattern. All previously known real-time string matching algorithms use Ω(m) extra space.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsSuleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusoz
PublisherSpringer Verlag
Pages117-129
Number of pages13
ISBN (Print)354022341X, 9783540223412
DOIs
StatePublished - Jan 1 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3109
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Real-time string matching in sublinear space'. Together they form a unique fingerprint.

  • Cite this

    Ga̧sieniec, L., & Kolpakov, R. (2004). Real-time string matching in sublinear space. In S. C. Sahinalp, S. Muthukrishnan, & U. Dogrusoz (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 117-129). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3109). Springer Verlag. https://doi.org/10.1007/978-3-540-27801-6_9