Skip to main content
Fig. 4 | BMC Bioinformatics

Fig. 4

From: Computing the family-free DCJ similarity

Fig. 4

Considering, as in Fig. 2, the genomes \(A =\left \{\left (\circ \;1\;2\;3\;4\;5\;6\;\circ \right)\right \}\) and \(B =\left \{\left (\circ \;7\;8\;{-9}\;{-10}\;11\;{-12}\;{-13}\;14\;\circ \right)\right \}\), let M1 (dashed edges) and M2 (dotted edges) be two distinct maximal matchings in GS σ (A,B), shown in the upper part. The two resulting weighted adjacency graphs \(AG_{\sigma }\left (A^{M_{1}},B^{M_{1}}\right)\), that has two cycles and two even paths, and \(AG_{\sigma }\left (A^{M_{2}},B^{M_{2}}\right)\), that has two odd paths, are shown in the lower part

Back to article page