Linear-time Suffix Sorting - A New Approach for Suffix Array Construction.

DOI10.4230/LIPIcs.CPM.2016.23zbMath1380.68164OpenAlexW2576782855MaRDI QIDQ5369558

Uwe Baier

Publication date: 17 October 2017

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6069/pdf/LIPIcs-CPM-2016-23.pdf/

zbMATH Keywords

linear timesuffix arraysorting algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Algorithms on strings (68W32)

Related Items (8)

Lyndon array construction during Burrows-Wheeler inversion ⋮ On the optimisation of the GSACA suffix array construction algorithm ⋮ Reconstructing a string from its Lyndon arrays ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform ⋮ The parameterized suffix tray ⋮ Inducing enhanced suffix arrays for string collections ⋮ Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order ⋮ More properties of the Fibonacci word on an infinite alphabet

This page was built for publication: Linear-time Suffix Sorting - A New Approach for Suffix Array Construction.