Kaikoura tree theorems: computing the maximum agreement subtree
Information Processing Letters
On the agreement of many trees
Information Processing Letters
Regular Article: Extension Operations on Sets of Leaf-Labeled Trees
Advances in Applied Mathematics
Reconstruction of rooted trees from subtrees
Discrete Applied Mathematics
Journal of the ACM (JACM)
A supertree method for rooted trees
Discrete Applied Mathematics
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Maximum likelihood on four taxa phylogenetic trees: analytic solutions
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Minimum-Flip Supertrees: Complexity and Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Using Max Cut to Enhance Rooted Trees Consistency
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Maximum agreement and compatible supertrees
Journal of Discrete Algorithms
Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
From Gene Trees to Species Trees through a Supertree Approach
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
The ultrametric constraint and its application to phylogenetics
Journal of Artificial Intelligence Research
New results on optimizing rooted triplets consistency
Discrete Applied Mathematics
The complexity of inferring a minimally resolved phylogenetic supertree
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Polynomial supertree methods revisited
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Building species trees from larger parts of phylogenomic databases
Information and Computation
FlipCut supertrees: towards matrix representation accuracy in polynomial time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Using semi-definite programming to enhance supertree resolvability
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
The Complexity of Inferring A Minimally Resolved Phylogenetic Supertree
SIAM Journal on Computing
| Hi-index | 0.00 |
A polynomial time supertree algorithm could play a key role in a divide-and-conquer strategy for assembling the tree of life. To date only a single such method capable of accommodate conflicting input trees has been proposed, the MinCutSupertree algorithm of Semple and Steel. This paper describes this algorithm and its implementation, then illustrates some weaknesses of the method. A modification to the algorithm that avoids some of these problems is proposed. The paper concludes by discussing some practical problems in supertree construction.