Another virtue of wavelet forests?

Christina Boucher, Travis Gagie, Aaron Hong +2

A wavelet forest for a text $T[\mathrm{1..}n]$ over an alphabet $\sigma$ takes $n{H}_0(T)+o(n\log \sigma )$ bits of space and supports access and rank on $T$ in $O(\log \sigma )$ time. Kärkkäinen and…