Dismantling DivSufSort

Johannes Fischer, Florian Kurpicz · arXiv (Cornell University) · 2017

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 competitive with the fastest known LCP-array construction algorithm.

Read the paper · More papers on PaperTik