pith. sign in

arxiv: 1710.01896 · v1 · pith:ZBP5Q5YEnew · submitted 2017-10-05 · 💻 cs.DS

Dismantling DivSufSort

Johannes Fischer , Florian Kurpicz This is my paper
classification 💻 cs.DS
keywords algorithmdivsufsortfastestknownlcp-arraycompetitivecomputesconcise
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.