A Unifying Framework for Compressed Pattern Matching (1999)
Cached
Download Links
- [www.i.kyushu-u.ac.jp]
- [www.i.kyushu-u.ac.jp]
- [www.i.kyushu-u.ac.jp]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. 6th International Symp. on String Processing and Information Retrieval |
| Citations: | 21 - 6 self |
BibTeX
@INPROCEEDINGS{Kida99aunifying,
author = {Takuya Kida and Yusuke Shibata and Masayuki Takeda and Ayumi Shinohara and Setsuo Arikawa},
title = {A Unifying Framework for Compressed Pattern Matching},
booktitle = {In Proc. 6th International Symp. on String Processing and Information Retrieval},
year = {1999},
pages = {89--96},
publisher = {IEEE CS Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce a general framework which is suitable to capture an essence of compressed pattern matching according to various dictionary based compressions. 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 extremely extends that for LZW compressed text presented by Amir, Benson and Farach. 1 Introduction Pattern matching is one of the most fundamental operations in string processing. The problem is to find all occurrences of a given pattern in a given text. A lot of classical or advanced pattern matching algorithms have been proposed (see [3, 2]). Data compression is another most important research topic, whose aim is to reduce its space usage. Considerable amount of compression methods have been pro...
