Skip to main content
Fig. 5 | BMC Bioinformatics

Fig. 5

From: Computing the family-free DCJ similarity

Fig. 5

Consider genomes \(A =\left \{\left (\circ \;1\;2\;3\;\circ \right)\right \}\) and \(B =\left \{\left (\circ \;{-4}\;5\;6\;{-7}\;\circ \right)\right \}\) and their gene similarity graph GS σ (A,B). The selection of the dashed cycle in AG σ (A,B) adds to the matching M in GS σ (A,B) the edges connecting gene 1 to gene 4 and gene 2 to gene 5. After this selection, although the matching M is not yet maximal, there are no more consistent cycles in AG σ (A,B). Observe that in GS σ (A,B) gene 6 is unsaturated and its single neighbor - gene 2 - is already saturated. Since gene 6 can no longer be saturated by M, it is a disposable gene and is deleted from AG σ (A,B), resulting in AGσ′(A,B), where a new consistent cycle appears. The selection of this new cycle adds to the matching M the edge connecting gene 3 to gene 7. Both AG σ (A,B) and AGσ′(A,B) have a simplified representation, in which the edge weights, as well as two of the four null edges of the capping, are omitted. Furthermore, for the sake of clarity, in this simplified representation each edge has a label describing the extremities connected by it

Back to article page