Space-efficient computation of the LCP array from the Burrows-Wheeler transform
From MaRDI portal
Publication:5088894
DOI10.4230/LIPIcs.CPM.2019.7OpenAlexW2962729511MaRDI QIDQ5088894
Nicola Prezza, Giovanna Rosone
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1901.05226
Cites Work
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Divide and conquer computation of the multi-string BWT and LCP array
- Computing the longest common prefix array based on the Burrows-Wheeler transform
- Wavelet trees for all
- An extension of the Burrows-Wheeler transform
- Lightweight LCP construction for very large collections of strings
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
- Alphabet-Independent Compressed Text Indexing
- Detecting Mutations by eBWT
- Lightweight BWT and LCP Merging via the Gap Algorithm
- Linear time construction of compressed text indices in compact space
