Johannes Fischer and Florian Kurpicz
Dismantling DivSufSort
Abstract: |
We give the first concise description of the fastest known suffix sorting algorithm in main memory, the DivSufSort by Yuta Mori. We then present an extension that also computes the LCP-array, which is competive with the fastest known LCP-array construction algorithm. |
Download paper: | |||
PostScript | BibTeX reference |