Dismantling DivSufSort
arXiv:1710.01896
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 competitive with the fastest known LCP-array construction algorithm.
Presented at the Prague Stringology Conference 2017