Processing of Huffman compressed texts with a super-alphabet.

DOI10.1007/B14038MaRDI QIDQ5897135zbMATH OpenOpenAlexFDO

Authors Kimmo Fredriksson, Jorma Tarhio

Publication date 9 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b14038

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 2140438
• Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• Pattern matching in Huffman encoded texts
• Let sleeping files lie: Pattern matching in Z-compressed files.

Cited in

(8)

• Pattern matching in Huffman encoded texts
• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
• Effect of file size, entropy and alphabet size on Huffman algorithm performance
• scientific article; zbMATH DE number 4045113 (Why is no real title available?)
• scientific article; zbMATH DE number 1529472 (Why is no real title available?)
• scientific article; zbMATH DE number 2140438 (Why is no real title available?)
• A general compression algorithm that supports fast searching

This page was built for publication: Processing of Huffman compressed texts with a super-alphabet.

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