Optimal pattern matching in LZW compressed strings

MaRDI QIDQ5365048zbMATH OpenFDO

Authors Paweł Gawrychowski

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133065

zbMATH Keywords

compressionLempel-Ziv-Welchpattern matching

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Recommendations

• Optimal pattern matching in LZW compressed strings
• Tying up the loose ends in fully LZW-compressed pattern matching
• Simple and efficient LZW-compressed multiple pattern matching
• Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
• Simple and efficient LZW-compressed multiple pattern matching

Cited in

(10)

• The complexity of compressed membership problems for finite automata
• Simple and efficient LZW-compressed multiple pattern matching
• Simple and efficient LZW-compressed multiple pattern matching
• Tying up the loose ends in fully LZW-compressed pattern matching
• Optimal pattern matching in LZW compressed strings
• scientific article; zbMATH DE number 2185628 (Why is no real title available?)
• Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
• Approximating LZ77 via Small-Space Multiple-Pattern Matching
• Improving Time and Space Complexity for Compressed Pattern Matching
• Compressed parameterized pattern matching

This page was built for publication: Optimal pattern matching in LZW compressed strings

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