Multiple pattern matching in LZW compressed text

Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa

研究成果: Conference article査読

52 被引用数 (Scopus)


In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Corasick pattern matching machine. The new algorithm finds all occurrences of multiple patterns whereas the algorithm proposed by Amir, Benson, and Farach finds only the first occurrence of a single pattern. The new algorithm runs in O(n + m2 + r) time using O(n + m2) space, where n is the length of the compressed text, m is the length of the total length of the patterns, and r is the number of occurrences of the patterns. We implemented a simple version of the algorithm, and showed that it is approximately twice faster than a decompression followed by a search using the Aho-Corasick machine.

ジャーナルData Compression Conference Proceedings
出版ステータスPublished - 1998 1 1
イベントProceedings of the 1998 Data Compression Conference, DCC - Snowbird, UT, USA
継続期間: 1998 3 301998 4 1

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信


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