An improved pattern matching algorithm for strings in terms of straight-line programs

Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda

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

47 Citations (Scopus)

Abstract

We show an efficient pattern-matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operation is the concatenation. In this paper, both text T and pattern P are given by straight-line programs T and P . The length of the text T (pattern P, resp.) may grow exponentially with respect to its description size ||T|| -- n (||P|| = m, resp.). We show a new combinatorial property concerning with the periodic occurrences of a pattern in a text. Based on this property, we develop an O(n2m2) time algorithm using O(nm) space, which outputs a compact representation of all occurrences of P in T. This is superior to the algorithm proposed by Karpinski et al.[11], which runs in O((n + m)4 log (n + m)) time using O((n + m)3) space, and finds only one occurrence. Moreover, our algorithm is much simpler than theirs.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings
EditorsAlberto Apostolico, Alberto Apostolico, Jotun Hein
PublisherSpringer Verlag
Pages1-11
Number of pages11
ISBN (Print)9783540632207
DOIs
Publication statusPublished - 1997
Event8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997 - Aarhus, Denmark
Duration: Jun 30 1997Jul 2 1997

Publication series

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

Other

Other8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997
CountryDenmark
CityAarhus
Period6/30/977/2/97

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An improved pattern matching algorithm for strings in terms of straight-line programs'. Together they form a unique fingerprint.

  • Cite this

    Miyazaki, M., Shinohara, A., & Takeda, M. (1997). An improved pattern matching algorithm for strings in terms of straight-line programs. In A. Apostolico, A. Apostolico, & J. Hein (Eds.), Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings (pp. 1-11). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1264). Springer Verlag. https://doi.org/10.1007/3-540-63220-4_45