Fully compressed pattern matching algorithm for balanced straight-line programs

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

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

11 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルProceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000
出版社Institute of Electrical and Electronics Engineers Inc.
ページ132-138
ページ数7
ISBN(電子版)0769507468, 9780769507460
DOI
出版ステータス出版済み - 2000
イベント7th International Symposium on String Processing and Information Retrieval, SPIRE 2000 - A Curuna, スペイン
継続期間: 9 27 20009 29 2000

その他

その他7th International Symposium on String Processing and Information Retrieval, SPIRE 2000
Countryスペイン
CityA Curuna
Period9/27/009/29/00

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Signal Processing
  • Information Systems and Management

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

引用スタイル