Faster sparse suffix sorting
From MaRDI portal
Publication:2965500
Recommendations
Cited in
(13)- Deterministic Sparse Suffix Sorting on Rewritable Texts
- Sparse suffix tree construction in small space
- Text sparsification via local maxima.
- Sparse suffix tree construction in optimal time and space
- Longest common extensions in sublinear space
- Deterministic Sparse Suffix Sorting in the Restore Model
- Sparse suffix and LCP array: simple, direct, small, and fast
- Improved characters distance sampling for online and offline text searching
- A Fast Suffix-Sorting Algorithm
- In-place sparse suffix sorting
- Faster suffix sorting
- Extracting the sparse longest common prefix array from the suffix binary search tree
- Scalable Suffix Sorting on a Multicore Machine
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)