Advertisement

Optimal Agreement Supertrees

  • David Bryant
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2066)

Abstract

An agreement supertree of a collection of unrooted phylogenetic trees T 1, T 2,...,T k with leaf sets \( \mathcal{L}\left( {T_1 } \right),\mathcal{L}\left( {T_2 } \right),...,\mathcal{L}\left( {T_k } \right) \) is an unrooted tree T with leaf set \( \mathcal{L}\left( {T_1 } \right) \cup ... \cup \mathcal{L}\left( {T_k } \right) \) such that each tree T i is an induced subtree of T. In some cases, there may be no possible agreement supertrees of a set of trees, in other cases there may be exponentially many. We present polynomial time algorithms for computing an optimal agreement supertree, if one exists, of a bounded number of binary trees. The criteria of optimality can be one of four standard phylogenetic criteria: binary character compatibility; maximum summed quartet weight; ordinary least squares; and minimum evolution. The techniques can be used to search an exponentially large number of trees in polynomial time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bryant, D.: Hunting for trees in binary character sets. Journal of Computational Biology 3(2), (1996) 275–288.CrossRefGoogle Scholar
  2. 2.
    Bryant, D.: Hunting for trees, building trees and comparing trees: theory and method in phylogenetic analysis. Ph.D. thesis, Dept. Mathematics, University of Canterbury (1997).Google Scholar
  3. 3.
    Finden, C.R. and Gordon. A.D. Obtaining common pruned trees. Journal of Classification, 2 (1986) 255–276.CrossRefGoogle Scholar
  4. 4.
    Gordon, A.D. Consensus supertrees: the synthesis of rooted trees containing over-lapping sets of leaves. Journal of Classification, 3 (1986) 335–348.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Bryant, D. Fast algorithms for constructing optimal trees with respect to OLS and minimum evolution criteria. In preparation.Google Scholar
  6. 6.
    Goddard, W., Kubicka, E., Kubicki, G., and McMorris, F.R.. (1994). The agreement metric for labelled binary trees. Mathematical Biosciences 123 215–226.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Bryant, D. and Steel, M. Constructing optimal trees from quartets. Journal of Algorithms (to appear)Google Scholar
  8. 8.
    D.H. Huson, S. Nettles, and T. Warnow: Obtaining highly accurate topology estimates of evolutionary trees from very short sequences. Proc. 3rd Annual Int. Conf. Comp. Mol. Biol. (RECOMB), (1998) 198–209.Google Scholar
  9. 9.
    M. Steel: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9 (1992) 91–116.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Swofford, D. L., G. J. Olsen, P. J. Waddell and D. M. Hillis: Phylogenetic Inference. in D. M. Hillis, C. Moritz, and B. K. Mable, eds. Molecular Systematics, second edition. Sinauer, Sunderland, Mass (1996) 407–514.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • David Bryant

There are no affiliations available

Personalised recommendations