Pattern matching in Huffman encoded texts
From MaRDI portal
Publication:2485022
DOI10.1016/j.ipm.2003.08.008zbMath1101.68814OpenAlexW2077701615MaRDI QIDQ2485022
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
Pattern recognition, speech recognition (68T10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (10)
Accelerating Boyer-Moore searches on binary texts ⋮ A general compression algorithm that supports fast searching ⋮ ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS ⋮ Compressed matching in dictionaries ⋮ Practical fixed length Lempel-Ziv coding ⋮ Integrated Encryption in Dynamic Arithmetic Compression ⋮ Integrated encryption in dynamic arithmetic compression ⋮ Direct merging of delta encoded files ⋮ COMPRESSED PATTERN MATCHING IN JPEG IMAGES ⋮ Guided blocks WOM codes
This page was built for publication: Pattern matching in Huffman encoded texts