Obtaining highly accurate topology estimates of evolutionary trees from very short sequences
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Constructing optimal trees from quartets
Journal of Algorithms
Fixed-Parameter algorithms for finding agreement supertrees
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
An agreement supertree of a collection of unrooted phylogenetic trees {T1, T2..., Tk} with leaf sets L(T1), L(T2),..., L(Tk) is an unrooted tree T with leaf set L(T1) ∪ ... ∪L(Tk) such that each tree Ti 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.