Fig. 2
From: A general framework for genome rearrangement with biological constraints
Two genomes with their respective sets of adjacencies \(\big \{\{1_t\}, \{1_h, 2_t\}, \{2_h,3_h\}, \{3_t\}\big \}\) and \(\big \{\{1_t\}, \{1_h, 2_h\}, \{2_t,3_h\}, \{3_t\}\big \}\). A DCJ \(\{1_{h},2_{t}\},\{2_{h},3_{h}\}\rightarrow \{1_{h},2_{h}\},\{2_{t},3_{h}\}\) transforms A into B. The transformation \(G(A,B)\rightarrow G(B,B)\) is a 2-break and G(B, B) is a terminal graph