2026-07-20T15:07:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6069 2024-03-06T10:37:36Z ddc:004 open_access

Linear-time Suffix Sorting - A New Approach for Suffix Array Construction Baier, Uwe Suffix array sorting algorithm linear time 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Uwe Baier 2016 Is Part Of LIPIcs, Volume 54, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CPM.2016.23 urn:nbn:de:0030-drops-60698 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.23 eng https://creativecommons.org/licenses/by/3.0/legalcode