Figure 10.
Contig assembly. If (a,b) and (a,c) overlap, then(b,c) are expected to overlap. Moreover, one can calculate thatshift(b,c) ≈ shift(a,c) − shift(a,b). We detect a repeat boundary toward the right of read a, if there is no overlap (b,c), nor any path of readsx1, …, xk such that(b,x1), (x1,x2), …, (xk,c) are all overlaps, andshift(b,x1) + … + shift(xk,c) ≈ shift(a,c) − shift(a,b).
