A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform
2019
Annual Symposium on Combinatorial Pattern Matching
We show that the Longest Common Prefix Array of a text collection of total size n on alphabet [1, σ] can be computed from the Burrows-Wheeler transformed collection in O(n log σ) time using o(n log σ) bits of working space on top of the input and output. Our result improves (on small alphabets) and generalizes (to string collections) the previous solution from Beller et al., which required O(n) bits of extra working space. We also show how to merge the BWTs of two collections of total size n
doi:10.4230/lipics.cpm.2019.7
dblp:conf/cpm/PrezzaR19
fatcat:catgit4bffdija2vgqodswzlem