Pattern matching in compressed texts
From MaRDI portal
Recommendations
- A general practical approach to pattern matching over Ziv-Lempel compressed text
- Practical and flexible pattern matching over Ziv-Lempel compressed text.
- Let sleeping files lie: Pattern matching in Z-compressed files.
- scientific article; zbMATH DE number 1263249
- String matching in Lempel-Ziv compressed strings
Cited in
(23)- Collage system: A unifying framework for compressed pattern matching.
- The complexity of compressed membership problems for finite automata
- Simple and efficient LZW-compressed multiple pattern matching
- A Boyer-Moore type algorithm for compressed pattern matching
- Speeding up pattern matching by text compression
- Pattern matching in compressed texts and images
- Finding characteristic substrings from compressed texts
- Efficient special cases of pattern matching with swaps
- Shift-And approach to pattern matching in LZW compressed text
- Pattern matching in text compressed by using antidictionaries
- scientific article; zbMATH DE number 1003304 (Why is no real title available?)
- Window Subsequence Problems for Compressed Texts
- Processing Compressed Texts: A Tractability Border
- Pattern Matching in DCA Coded Text
- scientific article; zbMATH DE number 1998342 (Why is no real title available?)
- Optimal two-dimensional compressed matching
- Efficiency of fast parallel pattern searching in highly compressed texts
- The sketching complexity of pattern matching
- Improving Time and Space Complexity for Compressed Pattern Matching
- An efficient pattern matching algorithm on a subclass of context free grammars
- Pattern matching on run-length grammar-compressed strings in linear time
- Compressed parameterized pattern matching
- Let sleeping files lie: Pattern matching in Z-compressed files.
This page was built for publication: Pattern matching in compressed texts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2956695)