Suffixient Sets

Lore Depuydt, Travis Gagie, Ben Langmead +2

We define a suffixient set for a text $T[\mathrm{1..}n]$ to be a set $S$ of positions between 1 and $n$ such that, for any edge descending from a node $u$ to a node $v$ in the suffix tree…