scientific article; zbMATH DE number 2140438

MaRDI QIDQ4654274zbMATH OpenFDO

Authors Kimmo Fredriksson, Jorma Tarhio

Publication date 3 March 2005

zbMATH Keywords

Huffman compressionnatural languagestring matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Natural language processing (68T50) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

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

Cited in

(8)

• Compressed matching in dictionaries
• Binary jumbled string matching for highly run-length compressible texts
• 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
• scientific article; zbMATH DE number 2087042 (Why is no real title available?)
• Processing of Huffman compressed texts with a super-alphabet.
• String matching over compressed text on handheld devices using tagged sub-optimal code (TSC)

This page was built for publication:

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