Algorithm computes smallest suffixient arrays in sublinear time O((n log σ)/√log n + min(r, r-bar) log^ε n) when alphabet is small and BWT has few runs.
Current Opinion in Genetics & Development15(6), 589–594 (2005)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computing Smallest Suffixient Arrays in Sublinear Time
Algorithm computes smallest suffixient arrays in sublinear time O((n log σ)/√log n + min(r, r-bar) log^ε n) when alphabet is small and BWT has few runs.