Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cracraft, J., Donoghue, M.: Assembling the Tree of Life. Oxford University Press, Oxford (2004)
Bininda-Emonds, O.R.P.: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, vol. 4. Kluwer Academic, Dordrecht (2004)
Hall, B.G.: Phylogenetic Trees Made Easy: A How-to Manual. 3 edn., Sinauer Associates, Inc (2007)
Bininda-Emonds, O.R.P., Gittleman, J.L., Steel, M.A.: The (Super) Tree of Life: Procedures, Problems, and Prospects. Annual Review of Ecology and Systematics 33, 265–289 (2002)
Gordon, A.D.: Consensus Supertrees: The Synthesis of Rooted Trees Containing Overlapping Sets of Labeled Leaves. Journal of Classification 3, 335–348 (1986)
Semple, C., Steel, M.: A Supertree Method for Rooted Trees. Discrete Applied Mathematics 105, 147–158 (2000)
Berry, V., Nicolas, F.: Maximum agreement and compatible supertrees. Journal of Discrete Algorithms 5, 564–591 (2007)
Constantinescu (Kant), M., Sankoff, D.: Tree Enumeration Modulo a Consensus. Journal of Classification 3, 349–356 (1986)
Margush, T., McMorris, F.R.: Consensus n-Trees. Bulletin of Mathematical Biology 43, 239–244 (1981)
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)
Day, W.H.E., Johnson, D.S., Sankoff, D.: The Computational Complexity of Inferring Rooted Phylogenies by Parsimony. Mathematical Biosciences 81, 33–42 (1986)
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)
Daniel, P., Semple, C.: A class of general supertree methods for nested taxa. SIAM Journal of Discrete Mathematics 19, 463–480 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kant, M., LeBon, M., Sankoff, D. (2008). Hierarchical Clustering Using Constraints. In: Măndoiu, I., Sunderraman, R., Zelikovsky, A. (eds) Bioinformatics Research and Applications. ISBRA 2008. Lecture Notes in Computer Science(), vol 4983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79450-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-79450-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79449-3
Online ISBN: 978-3-540-79450-9
eBook Packages: Computer ScienceComputer Science (R0)