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.
Cite
@article{arxiv.1710.01896,
title = {Dismantling DivSufSort},
author = {Johannes Fischer and Florian Kurpicz},
journal= {arXiv preprint arXiv:1710.01896},
year = {2017}
}
Comments
Presented at the Prague Stringology Conference 2017