Deterministic Sparse Suffix Sorting in the Restore Model [article]

Johannes Fischer, Tomohiro I, Dominik Köppl
2018 arXiv   pre-print
Given a text T of length n, we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of T in O(c √( n) + m m n ^* n) time with O(m) words of space under the premise that the space of T is rewritable, where m < n is the number of suffixes to be sorted (provided online and arbitrarily), and c is the number of characters with m < c < n that must be compared for distinguishing the designated suffixes.
arXiv:1509.07417v2 fatcat:bxdekvob7bcmxkmyfo3ktaauki