Optimal pattern matching in LZW compressed strings
From MaRDI portal
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
(14)- Streaming pattern matching with \(d\) wildcards
- Simple and efficient LZW-compressed multiple pattern matching
- Beating \(O(nm)\) in approximate LZW-compressed pattern matching
- Simple and efficient LZW-compressed multiple pattern matching
- Tying up the loose ends in fully LZW-compressed pattern matching
- 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
- scientific article; zbMATH DE number 1839439 (Why is no real title available?)
- Streaming periodicity with mismatches
- A space-optimal grammar compression
- Optimal pattern matching in LZW compressed strings
- Improving Time and Space Complexity for Compressed Pattern Matching
- Pattern matching on run-length grammar-compressed strings in linear time
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 Q2933655)