Approximate string matching over Ziv-Lempel compressed text
From MaRDI portal
Recommendations
- Approximate string matching on Ziv--Lempel compressed text
- Beating \(O(nm)\) in approximate LZW-compressed pattern matching
- Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
- Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
- Practical and flexible pattern matching over Ziv-Lempel compressed text.
Cited in
(15)- Approximate matching of run-length compressed strings
- Regular expression searching on compressed text
- Approximate string matching on Ziv--Lempel compressed text
- Collage system: A unifying framework for compressed pattern matching.
- Unified compression-based acceleration of edit-distance computation
- Approximate pattern matching in LZ77-compressed texts
- Binary jumbled string matching for highly run-length compressible texts
- Beating \(O(nm)\) in approximate LZW-compressed pattern matching
- Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
- Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
- Faster approximate pattern matching in compressed repetitive texts
- Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
- Approximate matching of run-length compressed strings
- Random access to grammar-compressed strings and trees
- Speeding up HMM decoding and training by exploiting sequence repetitions
This page was built for publication: Approximate string matching over Ziv-Lempel compressed text
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723951)