Faster semi-external suffix sorting
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6472611 (Why is no real title available?)
- An efficient, versatile approach to suffix sorting
- Compressed representations of sequences and full-text indexes
- Fast BWT in small space by blockwise suffix sorting
- Fast and Practical Algorithms for Computing All the Runs in a String
- Fast lightweight suffix array construction and checking
- Lightweight data indexing and compression in external memory
- Space efficient linear time construction of suffix arrays
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
This page was built for publication: Faster semi-external suffix sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445902)