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 .

Kupczok BMC Evolutionary Biology 2011 11:205   doi:10.1186/1471-2148-11-205
Download authors' original image