Simple and efficient LZW-compressed multiple pattern matching

DOI10.1007/978-3-642-31265-6_19MaRDI QIDQ2904496zbMATH OpenOpenAlexFDO

Authors Paweł Gawrychowski

Publication date 14 August 2012

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31265-6_19

zbMATH Keywords

compressionmultiple pattern matchingLempel-Ziv-Welch

Mathematics Subject Classification ID

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

Recommendations

• 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
• Optimal pattern matching in LZW compressed strings
• Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic

Cited in

(6)

• Simple and efficient LZW-compressed multiple pattern matching
• Optimal pattern matching in LZW compressed strings
• Tying up the loose ends in fully LZW-compressed pattern matching
• The complexity of compressed membership problems for finite automata
• Optimal pattern matching in LZW compressed strings
• Approximating LZ77 via Small-Space Multiple-Pattern Matching

This page was built for publication: Simple and efficient LZW-compressed multiple pattern matching

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