Efficient Lempel-Ziv Prediction with the Run-Length BWT
cs.DS, cs.LG
Submitted: 2026-11-01
Updated: 2026-11-01
Comments: 21 pages, 1 table
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Dynamic Range Majority Data Structures
- Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences
- Stringological sequence prediction II: Right-to-left automaticity and related complexity measures
- Stringological sequence prediction III: layered ziplines and a tradeoff between efficiency and expressivity
- Indexing Highly Repetitive String Collections
- Logarithmic Lower Bounds in the Cell-Probe Model
- Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time