Faster Sparse Suffix Sorting

DOI10.4230/LIPICS.STACS.2014.386zbMath1359.68338OpenAlexW2273956042MaRDI QIDQ2965500

Dominik Kempa, Juha Kärkkäinen, Tomohiro I.

Publication date: 3 March 2017

Full work available at URL: http://doi.org/10.4230/LIPIcs.STACS.2014.386

zbMATH Keywords

string algorithmsspace-time tradeoffssparse suffix sortingkarp-rabin fingerprintssparse suffix trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Algorithms on strings (68W32)

Related Items (3)

Extracting the sparse longest common prefix array from the suffix binary search tree ⋮ Longest Common Extensions in Sublinear Space ⋮ Improved characters distance sampling for online and offline text searching

This page was built for publication: Faster Sparse Suffix Sorting