Figure 6

Reduction of BGD to DCJ double distance problem. The left hand graph is the balanced bicoloured graph G, and the right hand graph represents the adjacencies of the duplicated genomes Δ and Π ⊕ Π. In the case of a degree 2 vertex in G, the adjacencies of Π ⊕ Π are determined, as one solution gives more cycles. In the case of a degree 4 vertex in G, the two possibilities for the adjacencies of Π ⊕ Π are shown (Π ⊕ Π contains either the vertical or horizontal dotted adjacencies).