Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Kaikoura tree theorems: computing the maximum agreement subtree
Information Processing Letters
On the agreement of many trees
Information Processing Letters
On the complexity of comparing evolutionary trees
Discrete Applied Mathematics - Special volume on computational molecular biology
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
SIAM Journal on Computing
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
SIAM Journal on Computing
Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Hi-index | 0.00 |
Given a set of leaf-labeled trees with identical leaf sets, the well-known Maximum Agreement SubTree (MAST) problem consists in finding a subtree homeomorphically included in all input trees and with the largest number of leaves. MAST and its variant called Maximum Compatible Tree (MCT) are of particular interest in computational biology. This article presents a linear-time approximation algorithm to solve the complement version of MAST, namely identifying the smallest set of leaves to remove from input trees to obtain isomorphic trees. We also present an O(n2 + kn) algorithm to solve the complement version of MCT. For both problems, we thus achieve significantly lower running times than previously known algorithms. Fast running times are especially important in phylogenetics where large collections of trees are routinely produced by resampling procedures, such as the nonparametric bootstrap or Bayesian MCMC methods.