Fig. 5
From: RefSelect: a reference sequence selection algorithm for planted (l, d) motif search
The effect of Hamming distance on the number of candidate motifs for three l-mers. This figure shows the effect of Hamming distance on the number of candidate motifs for three l-mers x 1, x 2 and x 3. The used (l, d) is set as (19, 7) and (19, 9) under the DNA data and protein data, respectively. We fix d H (x 1, x 2) = 2d − 2 and vary d H ' = (d H (x 1, x 3) + d H (x 2, x 3))/2 from 2d − 2 to 2d − 7. |M d (x 1, x 2, x 3)| is the number of common candidate motifs shared by the three l-mers. |M d '(x 1, x 2, x 3)| = |M d (x 1, x 2)| + |M d (x 1, x 3)| + |M d (x 2, x 3)| is the sum of the number of common candidate motifs shared by each pair of l-mers. a it is for the DNA data. b it is for the protein data