Deterministic Sparse Suffix Sorting in the Restore Model

DOI10.1145/3398681OpenAlexW3040814014MaRDI QIDQ5888941

Dominik Köppl, Johannes Fischer, 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

deterministic algorithmsonline algorithmsalphabet reductionsparse suffix sortingedit-sensitive parsing

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items

Grammar index by induced suffix sorting, Extracting the sparse longest common prefix array from the suffix binary search tree