Linear-time Suffix Sorting - A New Approach for Suffix Array Construction
Uwe Baier · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016
This paper presents a new approach for linear-time suffix sorting. It introduces a new sorting principle that can be used to build the first non-recursive linear-time suffix array construction algorithm named GSACA. Although GSACA cannot keep up with the performance of state of the art suffix array construction algorithms, the algorithm introduces a couple of new ideas for suffix array construction, and therefore can be seen as an ’idea collection’ for further suffix array construction improvements.