Skip to main content

Advertisement

Fig. 2 | Algorithms for Molecular Biology

Fig. 2

From: Approximating the DCJ distance of balanced genomes in linear time

Fig. 2

Two consistent decompositions for the same pair of genomes. The genomes (with gene indices omitted) are \(A= (\circ \; \overline{c} \; a \; f_1 \; \overline{e} \; d \; \overline{a} \; b \; i \; \overline{h} \; g \; \overline{b} \; \circ )\) and \(B= (\circ \; c \; a \; d \; e \; f \; \overline{a} \; b \; g \; h \; i \; \overline{b} \; \circ )\). Solid edges are in both decompositions. a A consistent decomposition \(D'\) containing the maximum number of cycles of length 2, composed of 2 cycles of length 2, 1 cycle of length 4 and 2 cycles of length 8, resulting in \(d_{D'} = 12 - 5 = 7\). b An optimal consistent decomposition \(D^*\), composed of 6 cycles of length 4, resulting in \(d_{D^*} = 12 - 6 = 6\)

Back to article page