Speeding up pattern matching by text compression
From MaRDI portal
Recommendations
- A general practical approach to pattern matching over Ziv-Lempel compressed text
- Pattern matching in compressed texts
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Boyer-Moore string matching over Ziv-Lempel compressed text
- Practical and flexible pattern matching over Ziv-Lempel compressed text.
Cited in
(15)- Collage system: A unifying framework for compressed pattern matching.
- Unified compression-based acceleration of edit-distance computation
- Efficient online string matching based on characters distance text sampling
- Finger search in grammar-compressed strings
- Improved characters distance sampling for online and offline text searching
- Re-examining regular expressions with backreferences
- Generalized biwords for bitext compression and translation spotting
- LZD factorization: simple and practical online grammar compression with variable-to-fixed encoding
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata
- LZ based compression benchmark on PE Files
- Random access to grammar-compressed strings and trees
- Improving Time and Space Complexity for Compressed Pattern Matching
- A fast dynamic compression scheme for natural language texts
- String matching over compressed text on handheld devices using tagged sub-optimal code (TSC)
- Speeding up HMM decoding and training by exploiting sequence repetitions
This page was built for publication: Speeding up pattern matching by text compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2728909)