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

Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

47 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルCombinatorial Pattern Matching - 8th Annual Symposium, CPM 1997, Proceedings
編集者Alberto Apostolico, Alberto Apostolico, Jotun Hein
出版社Springer Verlag
ページ1-11
ページ数11
ISBN(印刷版)9783540632207
DOI
出版ステータス出版済み - 1997
イベント8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997 - Aarhus, デンマーク
継続期間: 6 30 19977 2 1997

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1264
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997
国/地域デンマーク
CityAarhus
Period6/30/977/2/97

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「An improved pattern matching algorithm for strings in terms of straight-line programs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル