Efficient Merging, Construction, and Maintenance of Evolutionary Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
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
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Finding Smallest Supertrees Under Minor Containment
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Calculation, Visualization, and Manipulation of MASTs (Maximum Agreement Subtrees)
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
Computing the maximum agreement of phylogenetic networks
Theoretical Computer Science - Pattern discovery in the post genome
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Pattern Identification in Biogeography
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An algebraic view of the relation between largest common subtrees and smallest common supertrees
Theoretical Computer Science
Theoretical Computer Science
Maximum agreement and compatible supertrees
Journal of Discrete Algorithms
Discovering Frequent Agreement Subtrees from Phylogenetic Data
IEEE Transactions on Knowledge and Data Engineering
Theoretical Computer Science
Kernels Based on Distributions of Agreement Subtrees
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Linear time 3-approximation for the MAST problem
ACM Transactions on Algorithms (TALG)
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
Discrete Applied Mathematics
Split-Order Distance for Clustering and Classification Hierarchies
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Uncovering Hidden Phylogenetic Consensus in Large Data Sets
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A metric for phylogenetic trees based on matching
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Removing noise from gene trees
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
On the approximation of computing evolutionary trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Pattern identification in biogeography
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
The maximum agreement of two nested phylogenetic networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Uncovering hidden phylogenetic consensus
ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications
A Metric for Phylogenetic Trees Based on Matching
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Identifying rogue taxa through reduced consensus: NP-Hardness and exact algorithms
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Hi-index | 0.00 |
The maximum agreement subtree approach is one method of reconciling different evolutionary trees for the same set of species. An agreement subtree enables choosing a subset of the species for whom the restricted subtree is equivalent (under a suitable definition) in all given evolutionary trees.Recently, dynamic programming ideas were used to provide polynomial time algorithms for finding a maximum homeomorphic agreement subtree of two trees. Generalizing these methods to sets of more than two trees yields algorithms that are exponential in the number of trees. Unfortunately, it turns out that in reality one is usually presented with more than two trees, sometimes as many as thousands of trees.In this paper we prove that the maximum homeomorphic agreement subtree problem is $\cal{NP}$-complete for three trees with unbounded degrees. We then show an approximation algorithm of time O(kn5) for choosing the species that are not in a maximum agreement subtree of a set of k trees. Our approximation is guaranteed to provide a set that is no more than 4 times the optimum solution.While the set of evolutionary trees may be large in practice, the trees usually have very small degrees, typically no larger than three. We develop a new method for finding a maximum agreement subtree of k trees, of which one has degree bounded by d. This new method enables us to find a maximum agreement subtree in time O(knd + 1+ n2d).