Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts

DOI10.1016/j.ipm.2005.02.003zbMath1105.68035OpenAlexW2087989484MaRDI QIDQ2571245

Dana Shapira, Ajay Daptardar

Publication date: 1 November 2005

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

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

zbMATH Keywords

data compressionHuffman codescompressed pattern matchingskeleton treesKnuth-Morris-Pratt's algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (9)

Optimal Skeleton Huffman Trees Revisited ⋮ Random access to Fibonacci encoded files ⋮ ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS ⋮ A space efficient direct access data structure ⋮ Bidirectional adaptive compression ⋮ Optimal skeleton and reduced Huffman trees ⋮ Optimal Skeleton Huffman Trees ⋮ Forward looking Huffman coding ⋮ Direct merging of delta encoded files

This page was built for publication: Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts