Constant-time $\psi$ queries in $O \left( r \log \frac{n}{r} + r \log \sigma \right)$ bits
Abstract
Given a text $T [1..n]$ over an alphabet of size $\sigma$ whose BWT has $r$ runs, we can store $T$ in $O \left( r \log \frac{n}{r} + r \log \sigma \right)$ bits such that we can answer $\psi$ queries in constant time.
- Publication:
-
arXiv e-prints
- Pub Date:
- August 2024
- DOI:
- 10.48550/arXiv.2408.04537
- arXiv:
- arXiv:2408.04537
- Bibcode:
- 2024arXiv240804537G
- Keywords:
-
- Computer Science - Data Structures and Algorithms