Multiple Pattern Matching in LZW Compressed Text

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

(1998), pp. 103-112.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

arthit, automatic_summarization (group)

Find related articles with these CiteULike tags

lzw, matching, pattern, search

Abstract

In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns bysimulating the moveofthe 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.

@inproceedings{citeulike:1154351, abstract = {In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns bysimulating the moveofthe 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.}, author = {Kida, Takuya and Takeda, Masayuki and Shinohara, Ayumi and Miyazaki, Masamichi and Arikawa, Setsuo }, booktitle = {Data Compression Conference}, citeulike-article-id = {1154351}, keywords = {lzw, matching, pattern, search}, pages = {103--112}, posted-at = {2007-03-11 19:26:05}, priority = {2}, title = {Multiple Pattern Matching in LZW Compressed Text}, url = {http://citeseer.ist.psu.edu/556287.html}, year = {1998} }

RIS record

TY - CONF ID - citeulike:1154351 L3 - citeulike-article-id:1154351 TI - Multiple Pattern Matching in LZW Compressed Text T2 - Data Compression Conference SP - 103 EP - 112 N2 - In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns bysimulating the moveofthe 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. KW - lzw KW - matching KW - pattern KW - search AU - Kida, Takuya AU - Takeda, Masayuki AU - Shinohara, Ayumi AU - Miyazaki, Masamichi AU - Arikawa, Setsuo PY - 1998/// UR - http://citeseer.ist.psu.edu/556287.html ER -

RIS BibTeX