A Unifying Framework for Compressed Pattern Matching

Authors:
Takuya Kida;Yusuke Shibata;Masayuki Takeda;Ayumi Shinohara;Setsuo Arikawa
Affiliations:
-;-;-;-;-
Venue:
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Year:
1999

Citing 0
Cited 19

Fast and flexible word searching on compressed text

ACM Transactions on Information Systems (TOIS)
Approximating the smallest grammar: Kolmogorov complexity in natural models

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Boyer-Moore String Matching over Ziv-Lempel Compressed Text

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A Boyer-Moore Type Algorithm for Compressed Pattern Matching

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Approximate Matching of Run-Length Compressed Strings

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Multiple Pattern Matching Algorithms on Collage System

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Speeding Up Pattern Matching by Text Compression

CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Regular Expression Searching over Ziv-Lempel Compressed Text

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Path Matching in Compressed Control Flow Traces

DCC '02 Proceedings of the Data Compression Conference
Compressed Pattern Matching for Sequitur

DCC '01 Proceedings of the Data Compression Conference
Definability and compression

Fundamenta Informaticae - Special issue on computing patterns in strings
Regular expression searching on compressed text

Journal of Discrete Algorithms
Approximate string matching on Ziv-Lempel compressed text

Journal of Discrete Algorithms
New text indexing functionalities of the compressed suffix arrays

Journal of Algorithms
String Matching Over Compressed Text on Handheld Devices Using Tagged Sub-Optimal Code (TSC)

Real-Time Systems
LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text: Research Articles

Software—Practice & Experience
The design and evaluation of path matching schemes on compressed control flow traces

Journal of Systems and Software
Definability and Compression

Fundamenta Informaticae - Computing Patterns in Strings

Quantified Score

Hi-index	0.01

Visualization

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.