Deterministic Sparse Suffix Sorting in the Restore Model

DOI10.1145/3398681MaRDI QIDQ5888941zbMATH OpenOpenAlexFDO

Authors Johannes Fischer, Dominik Köppl, Tomohiro I

Publication date 26 April 2023

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3398681

zbMATH Keywords

online algorithmsdeterministic algorithmsalphabet reductionsparse suffix sortingedit-sensitive parsing

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Deterministic Sparse Suffix Sorting on Rewritable Texts
• Faster sparse suffix sorting
• In-place sparse suffix sorting
• Sparse suffix tree construction in small space
• Sparse text indexing in small space

Cited in

(4)

• Deterministic Sparse Suffix Sorting on Rewritable Texts
• Extracting the sparse longest common prefix array from the suffix binary search tree
• Grammar index by induced suffix sorting
• Sparse suffix and LCP array: simple, direct, small, and fast

This page was built for publication: Deterministic Sparse Suffix Sorting in the Restore Model

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