Figure 1.

Constructing the rolling minhash index. (a) A sliding window $B_i$ of length $w=10$ is moved over the hashes of all k-mers. At each position i of the sliding window, the positions with the $s=3$ lowest hash values are marked as minmers. The three minmers for each window are highlighted with colored circles, with the smallest hash in each window (the minimizer) having a bolded outline. Sampled minmers are also identified by an asterisk below their position. (b) The values of the hashes in the map M and heap H as the window slides over the sequence. The expired k-mers in the heap are crossed out. (c) The final sorted minmer interval index I.