Fully compressed pattern matching algorithm for balanced straight-line programs

M. Hirao, A. Shinohara, M. Takeda, S. Arikawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its variant. The length of the text T and pattern P may grow exponentially with respect to its description size n and m, respectively. The best known algorithm for the problems runs in O(n2m2) time using O(nm) space. The authors introduce a variant of straight-line programs, called balanced straight-line programs so that we establish a faster fully compressed pattern matching algorithm. Although the compression ratio of balanced straight-line programs may be worse than the original straight-line programs, they can still express exponentially long strings. Our algorithm runs in O(nm) time using O(nm) space.

Original languageEnglish
Title of host publicationProceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages132-138
Number of pages7
ISBN (Electronic)0769507468, 9780769507460
DOIs
Publication statusPublished - 2000 Jan 1
Externally publishedYes
Event7th International Symposium on String Processing and Information Retrieval, SPIRE 2000 - A Curuna, Spain
Duration: 2000 Sep 272000 Sep 29

Publication series

NameProceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000

Other

Other7th International Symposium on String Processing and Information Retrieval, SPIRE 2000
CountrySpain
CityA Curuna
Period00/9/2700/9/29

ASJC Scopus subject areas

  • Information Systems
  • Signal Processing
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Fully compressed pattern matching algorithm for balanced straight-line programs'. Together they form a unique fingerprint.

  • Cite this

    Hirao, M., Shinohara, A., Takeda, M., & Arikawa, S. (2000). Fully compressed pattern matching algorithm for balanced straight-line programs. In Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000 (pp. 132-138). [878188] (Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SPIRE.2000.878188