Pattern matching in Huffman encoded texts

DOI10.1016/J.IPM.2003.08.008MaRDI QIDQ2485022zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(13)

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

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)