Figure 1From: Efficient sequential and parallel algorithms for planted motif searchProof of theorem 1, case 1. Proof of theorem 1, case 1: There exists i,1≤i≤3 for which n i ≥d i . Without loss of generality we assume i=1. The top 3 rows represent the input l-mers. The last row shows a common neighbor M. In any column, identical colors represents matches, different colors represent mismatches.Back to article page