Hierarchical Clustering Using Constraints
We describe a new supertree algorithm that extends the type of information that can be used for phylogenetic inference. Its input is a set of constraints that expresses either the hierarchical relationships in a family of given phylogenies, or/and other relations between clusters of sets of species. The output of the algorithm is a multifurcating rooted supertree which satisfies all constraints. Moreover, if there were contradictions in the set of constraints the corresponding part of the supertree is identified and its set of constraints is displayed such as the user may decide to modify or keep it. Our algorithm is not affected by the order in which the input phylogenies or other constraints are presented. We apply our method to a number of data sets.
Unable to display preview. Download preview PDF.
- 1.Cracraft, J., Donoghue, M.: Assembling the Tree of Life. Oxford University Press, Oxford (2004)Google Scholar
- 3.Hall, B.G.: Phylogenetic Trees Made Easy: A How-to Manual. 3 edn., Sinauer Associates, Inc (2007)Google Scholar
- 10.Kant, M.: The Synthesis of Two Compatible Rooted Trees in a Rooted Supertree by an Algorithm on Sets. In: Proceedings of Fifth International Conference on Computing and Information (1993)Google Scholar
- 12.Koop, B.F., Tagle, D.A., Goodman, M., Slightom, J.L.: A molecular view of primate phylogeny and important systematic and evolutionary questions. Molecular Biology and Evolution 6, 580–612 (1989)Google Scholar