Faster semi-external suffix sorting
From MaRDI portal
Publication:2445902
DOI10.1016/j.ipl.2013.11.017zbMath1296.68033MaRDI QIDQ2445902
Publication date: 15 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.11.017
Cites Work
- Unnamed Item
- Lightweight data indexing and compression in external memory
- Fast BWT in small space by blockwise suffix sorting
- Space efficient linear time construction of suffix arrays
- Compressed representations of sequences and full-text indexes
- Fast and Practical Algorithms for Computing All the Runs in a String
- Fast Lightweight Suffix Array Construction and Checking
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- An efficient, versatile approach to suffix sorting