Pattern matching in Huffman encoded texts

Authors:
Shmuel T. Klein;Dana Shapira
Affiliations:
Department of Math. & CS, Bar Ilan University, Ramat-Gan 52900, Israel;Department of Computer Science, Brandeis University, Waltham, MA
Venue:
Information Processing and Management: an International Journal
Year:
2005

Citing 13
Cited 3

Storing text retrieval systems on CD-ROM: compression and encryption considerations

ACM Transactions on Information Systems (TOIS)
Bidirectional Huffman coding

The Computer Journal
String matching in Lempel-Ziv compressed strings

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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 fast string searching algorithm

Communications of the ACM
Managing Gigabytes: Compressing and Indexing Documents and Images

Managing Gigabytes: Compressing and Indexing Documents and Images
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Almost Optimal Fully LZW-Compressed Pattern Matching

DCC '99 Proceedings of the Conference on Data Compression
Parallel Huffman Decoding

DCC '00 Proceedings of the Conference on Data Compression
A New Compression Method for Compressed Matching

DCC '00 Proceedings of the Conference on Data Compression
Efficient randomized pattern-matching algorithms

IBM Journal of Research and Development - Mathematics and computing

Accelerating Boyer-Moore searches on binary texts

Theoretical Computer Science
On improving Tunstall codes

Information Processing and Management: an International Journal
Practical fixed length Lempel-Ziv coding

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a given text which has been encoded by a static Huffman code, the possibility of locating a given pattern directly in the compressed text is investigated. The main problem is one of synchronization, as an occurrence of the encoded pattern in the encoded text does not necessarily correspond to an occurrence of the pattern in the text. A simple algorithm is suggested which reduces the number of erroneously declared matches. The probability of such false matches is analyzed and empirically tested.