The Community for Technology Leaders
String Processing and Information Retrieval, International Symposium on (1999)
Cancun, Mexico
Sept. 21, 1999 to Sept. 24, 1999
ISBN: 0-7695-0268-7
pp: 89
Setsuo Arikawa , Kyushu University
Ayumi Shinohara , Kyushu University
Masayuki Takeda , Kyushu University
Takuya Kida , Kyushu University
Yusuke Shibata , Kyushu University
ABSTRACT
We introduce a general framework which is suitable to capture an essence of compressed pattern matching according to various dictionary based compressions, and propose a compressed pattern matching algorithm for the frame-work. The goal is to find all occurrences of a pattern in a text without decompression, which is one of the most active topics in string matching. Our framework includes such compression methods as Lempel-Ziv family, (LZ77, LZSS, LZ78, LZW), byte-pair encoding, and the static dictionary based method. Technically, our pattern matching algorithm extends that for LZW compressed text presented by Amir, Benson and Farach.
INDEX TERMS
CITATION
Setsuo Arikawa, Ayumi Shinohara, Masayuki Takeda, Takuya Kida, Yusuke Shibata, "A Unifying Framework for Compressed Pattern Matching", String Processing and Information Retrieval, International Symposium on, vol. 00, no. , pp. 89, 1999, doi:10.1109/SPIRE.1999.796582
90 ms
(Ver 3.3 (11022016))