Pattern matching in Huffman encoded texts

Data Compression Conference Proceedings

Volumn , Issue , 2001, Pages 449-458

  Klein, Shmuel T ^a   Shapira, Dana ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b BRANDEIS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA COMPRESSION; DECODING; ENCODING (SYMBOLS); PROBABILITY;

COMPRESSED MATCHING PROBLEM; HUFFMAN CODE;

PATTERN MATCHING;

EID: 0035006216     PISSN: 10680314     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipm.2003.08.008     Document Type: Article

References (18)

1. Efficient two-dimensional compressed matching
2. Let sleeping files lie: Pattern matching in Z-compressed files
3. A fast string searching algorithm
4. Almost optimal fully LZW-compressed pattern matching
5. Variable-length binary encodings
6. String matching in Lempel-Ziv compressed strings
7. Bidirectional Huffman coding
8. Approximate string matching over Ziv-Lempel compressed text
9. Efficient randomized pattern matching algorithms
10. Shift-and approach to pattern matching in LZW compressed text
11. Storing text retrieval systems on CD-ROM: Compression and encryption considerations
12. A new compression method for compressed matching
13. Parallel Huffman decoding
14. An application of informational divergence to Huffman codes
15. A text compression scheme that allows fast searching directly in the compressed file
16. Direct pattern matching on compressed text
17. A general practical approach to pattern matching over Ziv-Lempel compressed text
18. A Boyer-Moore type algorithm for compressed pattern matching