A Run-Time Efficient Implementation of Compressed Pattern Matching Automata

Authors:
Tetsuya Matsumoto;Kazuhito Hagio;Masayuki Takeda
Affiliations:
Department of Informatics, Kyushu University, Fukuoka, Japan 819-0395;Department of Informatics, Kyushu University, Fukuoka, Japan 819-0395;Department of Informatics, Kyushu University, Fukuoka, Japan 819-0395
Venue:
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Year:
2008

Citing 9
Cited 1

A new algorithm for data compression

The C Users Journal
Let sleeping files lie: pattern matching in Z-compressed files

Journal of Computer and System Sciences
A text compression scheme that allows fast searching directly in the compressed file

ACM Transactions on Information Systems (TOIS)
Fast and flexible word searching on compressed text

ACM Transactions on Information Systems (TOIS)
A Boyer-Moore Type Algorithm for Compressed Pattern Matching

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
String Matching with Stopper Encoding and Code Splitting

CPM '02 Proceedings of the 13th 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
Collage system: a unifying framework for compressed pattern matching

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Offline Dictionary-Based Compression

DCC '99 Proceedings of the Conference on Data Compression

Context-Sensitive Grammar Transform: Compression and Pattern Matching

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a run-time efficient implementation of automata for compressed pattern matching (CPM), where a text is given as a truncation-free collage system $\langle{\mathcal D},{\mathcal S}\rangle$ such that variable sequence $\mathcal S$ is encoded by any prefix code. We experimentally show that a combination of recursive-pairing compression and byte-oriented Huffman coding allows both a high compression ratio and a high speed CPM.