Shift-and approach to pattern matching in LZW compressed text

Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa

研究成果: Conference contribution

37 被引用数 (Scopus)

抄録

This paper considers the Shift-And approach to the problem of pattern matching in LZW compressed text, and gives a new algorithm that solves it. The algorithm is indeed fast when a pattern length is at most 32, or the word length. After an O(m +| Σ|) time and O(| Σ|) space preprocessing of a pattern, it scans an LZW compressed text in O(n + r) time and reports all occurrences of the pattern, where n is the compressed text length, m is the pattern length, and r is the number of the pattern occurrences. Experimental results show that it runs approxi- mately 1.5 times faster than a decompression followed by a simple search using the Shift-And algorithm. Moreover, the algorithm can be extended to the generalized pattern matching, to the pattern matching with k mismatches, and to the multiple pattern matching, like the Shift-And algorithm..

本文言語English
ホスト出版物のタイトルCombinatorial Pattern Matching - 10th Annual Symposium, CPM 1999, Proceedings
編集者Mike Paterson, Maxime Crochemore
出版社Springer Verlag
ページ1-13
ページ数13
ISBN(印刷版)3540662782, 9783540662785
DOI
出版ステータスPublished - 1999
外部発表はい
イベント10th Annual Symposium on Combinatorial Pattern Matching, CPM 1999 - Warwick, United Kingdom
継続期間: 1999 7 221999 7 24

出版物シリーズ

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

Other

Other10th Annual Symposium on Combinatorial Pattern Matching, CPM 1999
国/地域United Kingdom
CityWarwick
Period99/7/2299/7/24

ASJC Scopus subject areas

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

フィンガープリント

「Shift-and approach to pattern matching in LZW compressed text」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル