Fig. 1From: Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problemTanglegram instance and one of its optimal maps. The resultant map (right) of a pair of phylogenetic trees based on their known associations (left). What is special about this particular map is that it is composed of all four evolutionary events, codivergence (at nodes z and v), duplication (at node w), host switch (at node y) and loss (edge (z, x) at host node c)Back to article page