Substring Complexity in BWT-Runs Bounded Space
Given a string $T[1..n]$, its substring complexity is defined as $δ=\max_k d_k/k$, where $d_k$ is the number of its distinct substrings of length $k$ in $T$. We show how to compute it in $O(n+r\log r)$ time, using only $O(r)$ words of space, where $r$ denotes the number of runs in the Burrows-Wheeler transform.
Authors
- Johannes Fischer (ORCID: https://orcid.org/0000-0002-3384-597X)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-10-29
- DOI
- https://doi.org/10.48550/arxiv.2610.39482
- Primary Topic
- Algorithms and Data Compression
- Type
- preprint