Skip to main content
. 2014 Jan 31;15:34. doi: 10.1186/1471-2105-15-34

Figure 1.

Figure 1

Proof of theorem 1, case 1. Proof of theorem 1, case 1: There exists i,1≤i≤3 for which ni≥di. 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.