In-place sparse suffix sorting

MaRDI QIDQ4607987zbMATH OpenFDO

Authors Nicola Prezza

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1608.05100, http://dl.acm.org/citation.cfm?id=3175403

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Data structures (68P05) Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Recommendations

• Optimal in-place suffix sorting
• Optimal in-place suffix sorting
• Faster sparse suffix sorting
• In-Place Suffix Sorting
• Sparse text indexing in small space

Cited in

(12)

• Deterministic Sparse Suffix Sorting on Rewritable Texts
• Text sparsification via local maxima.
• Sparse suffix tree construction in optimal time and space
• Deterministic Sparse Suffix Sorting in the Restore Model
• In-Place Suffix Sorting
• Optimal in-place suffix sorting
• Sampling lower bounds: Boolean average-case and permutations
• Faster sparse suffix sorting
• Optimal in-place suffix sorting
• Internal shortest absent word queries in constant time and linear space
• Extracting the sparse longest common prefix array from the suffix binary search tree
• Practical Performance of Space Efficient Data Structures for Longest Common Extensions.

This page was built for publication: In-place sparse suffix sorting

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