Papers › Space-Efficient Construction of Compressed Suffix Trees
Space-Efficient Construction of Compressed Suffix Trees
Nicola Prezza, Giovanna Rosone
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.
We show how to build several data structures of central importance to string processing, taking as input the Burrows-Wheeler transform (BWT) and using small extra working space. Let n be the text length and σ be the alphabet size. We first provide two algorithms that enumerate all LCP values and suffix tree intervals in O(nlogσ) time using just o(nlogσ) bits of working space on top of the input BWT. Using these algorithms as building blocks, for any parameter 0 < ϵ≤1 we show how to build the PLCP bitvector and the balanced parentheses representation of the suffix tree topology in O(n(logσ+ ϵ⁻¹·loglogn)) time using at most nlogσ·(ϵ+ o(1)) bits of working space on top of the input BWT and the output. In particular, this implies that we can build a compressed suffix tree from the BWT using just succinct working space (i.e. o(nlogσ) bits) and any time in Θ(nlogσ) + ω(nloglogn). This improves the previous most space-efficient algorithms, which worked in O(n) bits and O(nlogn) time. We also consider the problem of merging BWTs of string collections, and provide a solution running in O(nlogσ) time and using just o(nlogσ) bits of working space. An efficient implementation of our LCP construction and BWT merge algorithms use (in RAM) as few as n bits on top of a packed representation of the input/output and process data as fast as $2.92$ megabases per second.
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