Pattern matching in Huffman encoded texts

DOI10.1016/J.IPM.2003.08.008zbMATH Open1101.68814OpenAlexW2077701615MaRDI QIDQ2485022FDOQ2485022

Authors: Shmuel T. Klein, Dana Shapira 

Publication date: 3 August 2005

Published in: Information Processing and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipm.2003.08.008

Recommendations

• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
• scientific article; zbMATH DE number 2140438
• Processing of Huffman compressed texts with a super-alphabet.
• Compressed matching in dictionaries

zbMATH Keywords

Huffman codesPattern matchingData compressionCompressed matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (13)

• Accelerating Boyer-Moore searches on binary texts
• A general compression algorithm that supports fast searching
• Compressed matching in dictionaries
• Processing of Huffman compressed texts with a super-alphabet.
• COMPRESSED PATTERN MATCHING IN JPEG IMAGES
• Synchronizing dynamic Huffman codes
• Integrated encryption in dynamic arithmetic compression
• Integrated encryption in dynamic arithmetic compression
• Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
• Practical fixed length Lempel-Ziv coding
• Direct merging of delta encoded files
• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• Guided blocks WOM codes

This page was built for publication: Pattern matching in Huffman encoded texts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485022)