In-place sparse suffix sorting

zbMATH Open1403.68376arXiv1608.05100MaRDI QIDQ4607987FDOQ4607987

Authors: Nicola Prezza 

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1608.05100

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

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)

Cited In (12)

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

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)