In-place sparse suffix sorting
From MaRDI portal
Publication:4607987
Recommendations
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)