Smallest suffixient set size χ is O(r) for BWT runs r, o(v) for some lex parses, bounded by σ+2 on episturmian words, increases by at most 2 on append/prepend, and can increase by Ω(√n) under edits or rotations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
Smallest suffixient set size χ is O(r) for BWT runs r, o(v) for some lex parses, bounded by σ+2 on episturmian words, increases by at most 2 on append/prepend, and can increase by Ω(√n) under edits or rotations.