Faster reliable phylogenetic analysis
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Fast algorithms for constructing optimal trees from quartets
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Reconstructing minimal rooted trees
Discrete Applied Mathematics
Compatibility of unrooted phylogenetic trees is FPT
Theoretical Computer Science - Parameterized and exact computation
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
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
Discrete Applied Mathematics
The ultrametric constraint and its application to phylogenetics
Journal of Artificial Intelligence Research
An improved fixed-parameter algorithm for minimum-flip consensus trees
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
The complexity of rooted phylogeny problems
Proceedings of the 13th International Conference on Database Theory
Building species trees from larger parts of phylogenomic databases
Information and Computation
Clustering with relative constraints
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees
ACM Transactions on Algorithms (TALG)
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Using semi-definite programming to enhance supertree resolvability
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Improved lower bounds on the compatibility of quartets, triplets, and multi-state characters
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Kernel and fast algorithm for dense triplet inconsistency
Theoretical Computer Science
| Hi-index | 0.00 |
A fundamental problem in classification is how to combine collections of trees having overlapping sets of leaves. The requirement that such a collection of trees is realized by at least one parent tree determines uniquely some additional subtrees not in the original collection. We analyze the ''rules'' that arise in this way by defining a closure operator for sets of trees. In particular we show that there exist rules of arbitrarily high order which cannot be reduced to repeated application of lower-order rules.