Skip to main content
Figure 1 | BMC Evolutionary Biology

Figure 1

From: Split-based computation of majority-rule supertrees

Figure 1

Example input- and supertree. Example supertree (a) and input tree (b) for distance computations. Both trees are identified by its split sets: = {AB|CDEFGH, ABC|DEFGH, ABCD|EFGH, FGH|ABCDE, GH|ABCDEF} and = {DF|CGH, GH|CDF} The supertree pruned to the taxa in is shown in (c). Thus d- = 2. (d) shows a tree that results in an optimal distance of d+ = 4 and (e) shows a tree that results in an optimal distance of .

Back to article page