Skip to main content
Figure 1 | BMC Genomics

Figure 1

From: Orthology and paralogy constraints: satisfiability and consistency

Figure 1

Constraint graph, satisfiability and consistency. A constraint graph R = (V, E, U) with E and U depicted by solid and dotted edges, along with with two satisfiable realizations R1 = R({d1e1}) and R2 = R({d1c2}). The gene names correspond to their respective species in the species tree S. The tree G1 is a DS-tree that satisfies R1 while G2 is a DS-tree that satisfies R2. Duplication nodes in G1 and G2 are indicated by a green square. G1 is not consistent with S because for instance, G1 has the speciation triplet s(a1)s(d1)|s(e1) = ad|e while S has the de|a triplet. The tree G2 is consistent with S.

Back to article page