Pattern matching on run-length grammar-compressed strings in linear time
From MaRDI portal
Cites work
- A linear-time algorithm for seeds computation
- A note on the maximum number of k-powers in a finite word
- Algorithmics on SLP-compressed strings: a survey
- Algorithms on Strings, Trees and Sequences
- An O(n log n) algorithm for finding all repetitions in a string
- Automata, Languages and Programming
- Balancing run-length straight-line programs
- Balancing Straight-line Programs
- Collage system: A unifying framework for compressed pattern matching.
- Collapsing the hierarchy of compressed data structures: suffix arrays in optimal compressed space
- Fast \(q\)-gram mining on SLP compressed strings
- Faster subsequence and don't-care pattern matching on compressed texts
- Finding maximal repetitions in a word in linear time
- Fully dynamic data structure for LCE queries in compressed space
- Iterated straight-line programs
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Linear time construction of cover suffix tree and applications
- Near-optimal search time in -optimal space
- On-line construction of suffix trees
- Optimal pattern matching in LZW compressed strings
- Pattern matching in compressed texts
- Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
- Pattern matching on grammar-compressed strings in linear time
- Random access to grammar-compressed strings and trees
- String matching in Lempel-Ziv compressed strings
- The exact online string matching problem: a review of the most recent results
- Toward a Definitive Compressibility Measure for Repetitive Sequences
This page was built for publication: Pattern matching on run-length grammar-compressed strings in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299442)
