Figure 2From: Efficient sequential and parallel algorithms for planted motif searchProof of theorem 1, case 2. Proof of theorem 1, case 2: n i <d i for all i, 1≤i≤3. 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