Skip to main content
. Author manuscript; available in PMC: 2015 May 8.
Published in final edited form as: Mol Phylogenet Evol. 2012 Aug 21;65(3):871–882. doi: 10.1016/j.ympev.2012.08.008

Figure 3.

Figure 3

On the top is the breakpoint graph of genome G = 1, 2,-3, 4,-5, with respect to the identity genome G = 1, 2, 3, 4, 5. We can see there are two cycles in the graph. An optimal DCJ operation removes adjacencies (2,7), (3,8) and creates adjacencies (2,3), (7,8) so that the number of cycles increases by one.