Faster semi-external suffix sorting
From MaRDI portal
Publication:2445902
DOI10.1016/J.IPL.2013.11.017zbMATH Open1296.68033OpenAlexW1986880831MaRDI QIDQ2445902FDOQ2445902
Authors: Jasbir Dhaliwal
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Compressed representations of sequences and full-text indexes
- Space efficient linear time construction of suffix arrays
- Fast and Practical Algorithms for Computing All the Runs in a String
- Fast BWT in small space by blockwise suffix sorting
- Lightweight data indexing and compression in external memory
- An efficient, versatile approach to suffix sorting
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Fast lightweight suffix array construction and checking
Cited In (2)
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)