Logarithmic-time internal pattern matching queries in compressed and dynamic texts
From MaRDI portal
Cites work
- Algorithms and Data Structures
- Approximate circular pattern matching
- Approximate circular pattern matching under edit distance
- Collapsing the hierarchy of compressed data structures: suffix arrays in optimal compressed space
- Dynamic suffix array with polylogarithmic queries and updates
- Efficient pattern matching with scaling
- Fast string matching with k differences
- Faster approximate pattern matching: a unified approach
- Faster fully compressed pattern matching by recompression
- Faster pattern matching under edit distance: a reduction to dynamic puzzle matching and the seaweed monoid of permutation matrices
- Fully dynamic data structure for LCE queries in compressed space
- Grammar-based codes: a new class of universal lossless source codes
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 6850408 (Why is no real title available?)
- scientific article; zbMATH DE number 1445383 (Why is no real title available?)
- Internal pattern matching queries in a text and applications
- Internal pattern matching queries in a text and applications
- Longest common extensions with recompression
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- Modular subset sum, dynamic strings, and zero-sum sets
- Recompression: a simple and powerful technique for word equations
- Resolution of the Burrows-Wheeler transform conjecture
- Symmetry breaking for suffix tree construction
- The dynamic k-mismatch problem
- Toward a Definitive Compressibility Measure for Repetitive Sequences
This page was built for publication: Logarithmic-time internal pattern matching queries in compressed and dynamic texts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233458)
