Skip to main content Link Search Menu Expand Document (external link)
Florian Kurpicz

Dismantling DivSufSort

conference website arXiv slides pdf code

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.

BibTeX 

@inproceedings{Kurpicz2017PSC,
  author    = {Johannes Fischer and Florian Kurpicz},
  title     = {Dismantling DivSufSort},
  booktitle = {PSC},
  pages     = {62–76},
  publisher = {Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague},
  year      = {2017}
}

PDF