Faster sparse suffix sorting

DOI10.4230/LIPICS.STACS.2014.386zbMATH Open1359.68338OpenAlexW2273956042MaRDI QIDQ2965500FDOQ2965500

Authors: Juha Kärkkäinen, Dominik Kempa, Tomohiro I 

Publication date: 3 March 2017

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

Recommendations

• Sparse suffix tree construction in small space
• Sparse suffix tree construction in optimal time and space
• In-place sparse suffix sorting
• Faster suffix sorting
• Sparse text indexing in small space

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (13)

• A Fast Suffix-Sorting Algorithm
• Text sparsification via local maxima.
• Deterministic Sparse Suffix Sorting in the Restore Model
• Sparse suffix tree construction in optimal time and space
• Deterministic Sparse Suffix Sorting on Rewritable Texts
• In-place sparse suffix sorting
• Extracting the sparse longest common prefix array from the suffix binary search tree
• Faster suffix sorting
• Sparse suffix tree construction in small space
• Longest common extensions in sublinear space
• Improved characters distance sampling for online and offline text searching
• Scalable Suffix Sorting on a Multicore Machine
• Sparse suffix and LCP array: simple, direct, small, and fast

This page was built for publication: Faster sparse suffix sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965500)