Papers › Another virtue of wavelet forests?
Another virtue of wavelet forests?
Christina Boucher, Travis Gagie, Aaron Hong, Yansong Li, Norbert Zeh
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A wavelet forest for a text T [1..n] over an alphabet σ takes n H₀ (T) + o (n logσ) bits of space and supports access and rank on T in O (logσ) time. K\"arkk\"ainen and Puglisi (2011) implicitly introduced wavelet forests and showed that when T is the Burrows-Wheeler Transform (BWT) of a string S, then a wavelet forest for T occupies space bounded in terms of higher-order empirical entropies of S even when the forest is implemented with uncompressed bitvectors. In this paper we show experimentally that wavelet forests also have better access locality than wavelet trees and are thus interesting even when higher-order compression is not effective on S, or when T is not a BWT at all.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections