Minimizers in Semi-Dynamic Strings

Wiktor Zuba, Oded Lachish, Solon P. Pissis

Minimizers sampling is one of the most widely-used mechanisms for sampling strings. Let $S=S[0]\dots S[n-1]$ be a string over an alphabet $\Sigma$. In addition, let $w\ge 2$ and $k\ge…