Fig. 4
From: Predicting horizontal gene transfers with perfect transfer networks
An example of a solution that will be given by our greedy algorithm (1) The given instance T with \(\mathcal {C}= \{a,b,c\}\). Triangles represent subtrees and colors represent the characters that can be found on them (2) One possible solution output by Algorithm 2. The green arrow joins the first two subtrees that contain \(\{a,b\}\), the yellow arrows joins the second subtree with the subtree that contains only \(\{a\}\) and the final arrow connects two subtrees that contain only \(\{c\}\)