Skip to main content


Fig. 4 | Algorithms for Molecular Biology

Fig. 4

From: Models and algorithms for genome rearrangement with positional constraints

Fig. 4

The update of colors by a DCJ. a Adjacency edges with colors x and y are reconfigured in two different ways for the same DCJ operation. In this case the reconfigurations are achieved by swapping either both right-hand endpoints or both left-hand endpoints of the adjacency edges. b The adjacency edge with color x is split to make two adjacencies of color x with two new telomeres

Back to article page