Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
DOI10.1142/S0129054112400163zbMATH Open1246.68274OpenAlexW1976439571MaRDI QIDQ2909199FDOQ2909199
Authors: Domenico Cantone, Simone Faro, Emanuele Giaquinta 
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
Recommendations
information retrievalstring matchingHuffman codingtext processingcompression algorithmsBoyer-Moore algorithm
Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32) Computing methodologies for text processing; mathematical typography (68U15)
Cites Work
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- A Method for the Construction of Minimum-Redundancy Codes
- Generating a canonical prefix encoding
- Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
- Fast exact string matching algorithms
- Pattern matching in Huffman encoded texts
- Bidirectional Huffman coding
Cited In (9)
- Title not available (Why is that?)
- Accelerating Boyer-Moore searches on binary texts
- Pattern matching in Huffman encoded texts
- Processing of Huffman compressed texts with a super-alphabet.
- Title not available (Why is that?)
- Accelerating Boyer Moore Searches on Binary Texts
- Improved characters distance sampling for online and offline text searching
- Efficient online string matching based on characters distance text sampling
- Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
This page was built for publication: Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909199)
