Figure 4

Construction of matching for genome I _ℓ with ℓ linear chromosomes ( i unsaturated vertices) and a general genome A. Adjacencies of I are represented by black edges and those of A by grey edges. Visited (unvisited) vertices are black (white). We can create a cycle only when e + i is even (a). We can merge two paths when e + i is even (b) or odd (e). We can connect an unsaturated vertex when e = i (h), when e + i is even (c) or odd (f). We can skip a vertex when e = i (i), when e + i is even (d) or when e + i odd (g). In (c) and (d), the parity of e + i is changed.