Deterministic Sparse Suffix Sorting in the Restore Model

TL;DR

This paper introduces a deterministic online algorithm for sparse suffix sorting that operates efficiently in the restore model, optimizing time and space for sorting selected suffixes of a text.

Contribution

The paper presents the first deterministic online sparse suffix sorting algorithm in the restore model with improved time complexity.

Findings

Achieves $O(c \, \sqrt{\lg n} + m \lg m \lg n \lg^* n)$ time complexity.

Uses $O(m)$ words of space, assuming the text's space is rewritable.

Handles online and arbitrary selection of suffixes to be sorted.

Abstract

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 \sqrt{\lg n} + m \lg m \lg n \lg^* n)$ time with $O(m)$ words of space under the premise that the space of $T$ is rewritable, where $m \le n$ is the number of suffixes to be sorted (provided online and arbitrarily), and $c$ is the number of characters with $m \le c \le n$ that must be compared for distinguishing the designated suffixes.