TY - GEN

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

AU - Miyazaki, Masamichi

AU - Shinohara, Ayumi

AU - Takeda, Masayuki

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84948958591&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84948958591&partnerID=8YFLogxK

U2 - 10.1007/3-540-63220-4_45

DO - 10.1007/3-540-63220-4_45

M3 - Conference contribution

AN - SCOPUS:84948958591

SN - 9783540632207

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 11

BT - Combinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings

A2 - Apostolico, Alberto

A2 - Apostolico, Alberto

A2 - Hein, Jotun

PB - Springer Verlag

T2 - 8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997

Y2 - 30 June 1997 through 2 July 1997

ER -