Skip to main content
Fig. 1 | Algorithms for Molecular Biology

Fig. 1

From: The distance and median problems in the single-cut-or-join model with single-gene duplications

Fig. 1

In a each color represents a gene family from A. Notice that each gene in D1 and \(D_2\) can be traced to a unique gene in M whereas a gene from A might have multiple daughters in M. b displays the gene tree of the gene family in blue [indicated by arrows in (a)]. Since the gene \(a_2\) undergoes duplication (dark squares) to form \(g_1\) and \(g_3\) in M, M is not trivial w.r.t A

Back to article page