Constant-space string-matching in sublinear average time

Maxime Crochemore, Leszek Ga̧sieniec, Wojciech Rytter

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

Given two strings: pattern P of length m and text T of length n. The string-matching problem is to find all occurrences of the pattern P in the text T. We present a string-matching algorithms which works in o(n) average time and constant additional space for one-dimensional texts and two-dimensional arrays. This is a first attempt to the small-space string-matching problem in which sublinear time algorithms are achieved. We show that all occurrences of one- or two-dimensional patterns can be found in O(n/r) average time with constant memory, where r is the repetition size of P (size of the longest repeated subword of P).

Original languageEnglish (US)
Pages (from-to)197-203
Number of pages7
JournalTheoretical Computer Science
Volume218
Issue number1
DOIs
StatePublished - Apr 28 1999
EventProceedings of the 1997 International Conference on Compression and Complexity of Sequences - Positano, Italy
Duration: Jun 11 1997Jun 13 1997

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this