Skip to main content


Fig. 2 | Algorithms for Molecular Biology

Fig. 2

From: On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model

Fig. 2

A part of a gene tree mapped onto a species tree. Circular nodes correspond to gene nodes in the gene tree and rectangular nodes \(g'\) and \(g''\) correspond to implied speciation nodes. The two loci are indicated in solid red and dashed blue. There is a loss on the edges \((g_1, g_2)\) and \((g', g_3)\) because the red locus is present at the tops of each of those edges but not at the bottoms of those edges. There is also a loss on edge \((g'', g_5)\) because the blue locus is present at the top of that edge but not the bottom

Back to article page