Advertisement

Hierarchical Clustering Using Constraints

  • Mariana Kant
  • Maurice LeBon
  • David Sankoff
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4983)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cracraft, J., Donoghue, M.: Assembling the Tree of Life. Oxford University Press, Oxford (2004)Google Scholar
  2. 2.
    Bininda-Emonds, O.R.P.: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, vol. 4. Kluwer Academic, Dordrecht (2004)zbMATHGoogle Scholar
  3. 3.
    Hall, B.G.: Phylogenetic Trees Made Easy: A How-to Manual. 3 edn., Sinauer Associates, Inc (2007)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Gordon, A.D.: Consensus Supertrees: The Synthesis of Rooted Trees Containing Overlapping Sets of Labeled Leaves. Journal of Classification 3, 335–348 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Semple, C., Steel, M.: A Supertree Method for Rooted Trees. Discrete Applied Mathematics 105, 147–158 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Berry, V., Nicolas, F.: Maximum agreement and compatible supertrees. Journal of Discrete Algorithms 5, 564–591 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Constantinescu (Kant), M., Sankoff, D.: Tree Enumeration Modulo a Consensus. Journal of Classification 3, 349–356 (1986)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Margush, T., McMorris, F.R.: Consensus n-Trees. Bulletin of Mathematical Biology 43, 239–244 (1981)zbMATHMathSciNetGoogle Scholar
  10. 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
  11. 11.
    Day, W.H.E., Johnson, D.S., Sankoff, D.: The Computational Complexity of Inferring Rooted Phylogenies by Parsimony. Mathematical Biosciences 81, 33–42 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 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
  13. 13.
    Daniel, P., Semple, C.: A class of general supertree methods for nested taxa. SIAM Journal of Discrete Mathematics 19, 463–480 (2005)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mariana Kant
    • 1
  • Maurice LeBon
    • 1
  • David Sankoff
    • 2
  1. 1.Computer Science and Engineering DepartmentYork UniversityTorontoCanada
  2. 2.Department of Mathematics and StatisticsUniversity of OttawaOttawaCanada

Personalised recommendations