Answers are grounded in this paper and cite their sources.
Suffix array and inverse suffix array queries on a text of length n can be answered in O(τ³) time using an auxiliary data structure occupying $O(n/τ)$ words, for any τ∈ [1,n].
No takes yet. Share an insight, caveat, or question.
Sharma V. Thankachan (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: