Lightweight BWT Construction for Very Large String Collections
From MaRDI portal
Publication:3011856
DOI10.1007/978-3-642-21458-5_20zbMath1339.68323MaRDI QIDQ3011856
Markus J. Bauer, Anthony J. Cox, Giovanna Rosone
Publication date: 29 June 2011
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_20
Related Items
Lightweight algorithms for constructing and inverting the BWT of string collections, Lightweight LCP construction for very large collections of strings
Uses Software
Cites Work
- A space and time efficient algorithm for constructing compressed suffix arrays
- An extension of the Burrows-Wheeler transform
- A new combinatorial approach to sequence comparison
- Space efficient linear time construction of suffix arrays
- Linear work suffix array construction
- Indexing compressed text
- Linear-Time Construction of Suffix Arrays
- Lightweight Data Indexing and Compression in External Memory
- Linear Time Suffix Array Construction Using D-Critical Substrings
- Combinatorial Pattern Matching