ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS
Publication:2909199
DOI10.1142/S0129054112400163zbMath1246.68274OpenAlexW1976439571MaRDI QIDQ2909199
Simone Faro, Emanuele Giaquinta, Domenico Cantone
Publication date: 30 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054112400163
information retrievalstring matchingcompression algorithmsHuffman codingtext processingBoyer-Moore algorithm
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)
Related Items
Cites Work
- Fast exact string matching algorithms
- Pattern matching in Huffman encoded texts
- Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- Bidirectional Huffman Coding
- Generating a canonical prefix encoding
- A Method for the Construction of Minimum-Redundancy Codes