On the number of $k$-mers admitting a given lexicographical minimizer

Florian Ingels, Camille Marchet, Mikaël Salson

The minimizer of a word of size $k$ (a $k$-mer) is defined as its smallest substring of size $m$ (with $m\le k$), according to some ordering on $m$-mers. minimizers have been used…