Figure 3
Reduced genomes and their weighted adjacency graph. Considering the genomes A={(∘ 1 2 3 4 5 ∘)} and B={(∘ 6 −7 −8 −9 10 11 ∘)} as in Figure 2, let M 1 (dotted edges) and M 2 (dashed edges) be two distinct matchings in G S σ (A,B), shown in the upper part. The two resulting weighted adjacency graphs \(\protect \phantom {\dot {i}\!}{AG}_{\!\sigma }(A^{M_{1}},B^{M_{1}})\), that has two odd paths and three cycles, and \(\protect \phantom {\dot {i}\!}{AG}_{\!\sigma }(A^{M_{2}},B^{M_{2}})\), that has two odd paths and two cycles, are shown in the lower part.