Context-Sensitive Grammar Transform: Compression and Pattern Matching

Authors:
Shirou Maruyama;Yohei Tanaka;Hiroshi Sakamoto;Masayuki Takeda
Affiliations:
Department of Informatics, Kyushu University, Fukuoka, Japan 819-0395;Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology, Iizuka, Japan 820-8502;Faculty of Computer Science and Systems Engineering, Kyushu Institute of Technology, Iizuka, Japan 820-8502;Department of Informatics, Kyushu University, Fukuoka, Japan 819-0395
Venue:
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Year:
2008

Citing 11
Cited 1

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)
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
Application of Lempel--Ziv factorization to the approximation of grammar-based compression

Theoretical Computer Science
Algorithms on Strings

Algorithms on Strings
A Run-Time Efficient Implementation of Compressed Pattern Matching Automata

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform .2. With context models

IEEE Transactions on Information Theory
The smallest grammar problem

IEEE Transactions on Information Theory

Training parse trees for efficient VF coding

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

A framework of context-sensitive grammar transform is proposed. A greedy compression algorithm with the transform model is presented as well as a Knuth-Morris-Pratt (KMP)-type compressed pattern matching (CPM) algorithm. The compression performance is a match for gzip and Re-Pair. The search speed of our CPM algorithm is almost twice faster than the KMP type CPM algorithm on Byte-Pair-Encoding by Shibata et al. (2000), and in the case of short patterns, faster than the Boyer-Moore-Horspool algorithm with the stopper encoding by Rautio et al. (2002), which is regarded as one of the best combinations that allows a practically fast search.