Fig. 2From: RefSelect: a reference sequence selection algorithm for planted (l, d) motif searchIllustration of fast computation of Hamming distance. This figure shows an example for explaining how to compute the Hamming distance between every pair of l-mers in two input sequencesBack to article page