Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts

DOI10.1142/S0129054112400163MaRDI QIDQ2909199zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

information retrievalstring matchingHuffman codingtext processingcompression algorithmsBoyer-Moore algorithm

Mathematics Subject Classification ID

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)

Recommendations

• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• scientific article; zbMATH DE number 2140438
• scientific article; zbMATH DE number 1615279
• Pattern matching in Huffman encoded texts
• Processing of Huffman compressed texts with a super-alphabet.

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• A fast string searching algorithm
• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• Bidirectional Huffman coding
• Fast Pattern Matching in Strings
• Fast exact string matching algorithms
• Generating a canonical prefix encoding
• Pattern matching in Huffman encoded texts

Cited in

(9)

• Pattern matching in Huffman encoded texts
• Efficient online string matching based on characters distance text sampling
• scientific article; zbMATH DE number 2140438 (Why is no real title available?)
• Accelerating Boyer Moore Searches on Binary Texts
• Processing of Huffman compressed texts with a super-alphabet.
• Improved characters distance sampling for online and offline text searching
• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• scientific article; zbMATH DE number 2087042 (Why is no real title available?)
• Accelerating Boyer-Moore searches on binary 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)