Figure 3

Solving the MINIMUM LEAF REMOVAL RECONCILIATION problem for a tree satisfying CONSTRAINT C; (a) A gene tree T on G ={1,2,3,4,5,6,7,8}; (b) A species tree S for G . Internal vertices of S are identified with different characters. Labels of internal vertices of T are attributed according to the LCA mapping between T and S. T contains 5 duplication vertices with respect to S: two AD vertices (surrounded by a circle) and three NAD vertices (surrounded by a square); (c) The tree T^Iobtained by replacing the two subtrees of T rooted at each of the two AD vertices by their weighted induced trees. Leaves’ weights are given in brackets; (d) The weighted agreement subtree W^MAXof T^Iand S of maximum value. v(W^MAX)=7; (e) The subtree T^MAXof T induced by W^MAX. T^MAXis an MD-tree consistent with S.