Real-time string matching in sublinear space

Leszek Ga̧sieniec, Roman Kolpakov

Research output: Contribution to journalArticle

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)
Pages (from-to)117-129
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3109
StatePublished - Dec 1 2004
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this