scientific article; zbMATH DE number 2087042

MaRDI QIDQ4737688zbMATH OpenFDO

Authors Jussi Rautio, Jani Tanninen, Jorma Tarhio

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2373/23730042.htm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1615279
• Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
• scientific article; zbMATH DE number 2185629
• Practical and flexible pattern matching over Ziv-Lempel compressed text.
• scientific article; zbMATH DE number 2140438

Cited in

(5)

• A Run-Time Efficient Implementation of Compressed Pattern Matching Automata
• Fast and flexible packed string matching
• String matching with alphabet sampling
• String matching over compressed text on handheld devices using tagged sub-optimal code (TSC)
• A general compression algorithm that supports fast searching

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 Q4737688)