Skip to main content
Figure 4 | Algorithms for Molecular Biology

Figure 4

From: On the family-free DCJ distance and similarity

Figure 4

Gene similarity graph GS σ (A F ,B F ) constructed from the input genomes A={(∘ a c −b d ∘)} and B={(∘ −c d a c b −b ∘)} of (1,2) - EXDCJ-DISTANCE , where all edge weights are 1. Highlighted edges represent a maximal matching M in G S σ (A F,B F).

Back to article page

Algorithms for Molecular Biology

ISSN: 1748-7188