Issue No. 01 - January-March (2009 vol. 6)

ISSN: 1545-5963

pp: 62-75

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.51

Stephen J. Willson , Iowa State University, Ames

ABSTRACT

Given a collection of rooted phylogenetic trees with overlapping sets of leaves, a compatible supertree $S$ is a single tree whose set of leaves is the union of the input sets of leaves and such that $S$ agrees with each input tree when restricted to the leaves of the input tree. Typically with trees from real data, no compatible supertree exists, and various methods may be utilized to reconcile the incompatibilities in the input trees. This paper focuses on a measure of robustness of a supertree method called its ``radius" $R$. The larger the value of $R$ is, the further the data set can be from a natural correct tree $T$ and yet the method will still output $T$. It is shown that the maximal possible radius for a method is $R = 1/2$. Many familiar methods, both for supertrees and consensus trees, are shown to have $R = 0$, indicating that they need not output a tree $T$ that would seem to be the natural correct answer. A polynomial-time method Normalized Triplet Supertree (NTS) with the maximal possible $R = 1/2$ is defined. A geometric interpretion is given, and NTS is shown to solve an optimization problem. Additional properties of NTS are described.

INDEX TERMS

Trees, Graph algorithms, phylogenetic tree, supertree

CITATION

Stephen J. Willson, "Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data",

*IEEE/ACM Transactions on Computational Biology and Bioinformatics*, vol. 6, no. , pp. 62-75, January-March 2009, doi:10.1109/TCBB.2008.51