Recommendations
- An efficient algorithm for supertrees
- Constructing rooted supertrees using distances
- Extending the limits of supertree methods
- scientific article; zbMATH DE number 1974600
- Rooted maximum agreement supertrees
- LATIN 2004: Theoretical Informatics
- A Class of General Supertree Methods for Nested Taxa
- Reconstruction of rooted trees from subtrees
Cites work
- An efficient algorithm for supertrees
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
- Extension operations on sets of leaf-labelled trees
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Multi-Terminal Network Flows
- N-trees as nestings: Complexity, similarity, and consensus
- Reconstruction of rooted trees from subtrees
- The complexity of reconstructing trees from qualitative characters and subtrees
Cited in
(39)- Hybridization number on three rooted binary trees is EPT
- Complexity and algorithms for MUL-tree pruning
- scientific article; zbMATH DE number 1420917 (Why is no real title available?)
- Improved algorithms for maximum agreement and compatible supertrees
- scientific article; zbMATH DE number 1974598 (Why is no real title available?)
- scientific article; zbMATH DE number 1945190 (Why is no real title available?)
- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
- An integrated PCA DEA framework for assessment and ranking of manufacturing systems based on equipment performance
- Building species trees from larger parts of phylogenomic databases
- Reconstructing phylogenetic trees from multipartite quartet systems
- Extending the limits of supertree methods
- Exponentially many supertrees
- MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms
- FlipCut supertrees: towards matrix representation accuracy in polynomial time
- Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees
- New results on optimizing rooted triplets consistency
- A distance-based model for convergent evolution
- From Gene Trees to Species Trees through a Supertree Approach
- Finding smallest supertrees under minor containment
- Finding smallest supertrees
- Site pattern probabilities under the multispecies coalescent and a relaxed molecular clock: theory and applications
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
- Constructing rooted supertrees using distances
- Optimizing phylogenetic supertrees using answer set programming
- Orthology relations, symbolic ultrametrics, and cographs
- From subtrees to supertrees
- scientific article; zbMATH DE number 7561411 (Why is no real title available?)
- An efficient algorithm for supertrees
- Explosions and hot spots in supertree methods
- On the ancestral compatibility of two phylogenetic trees with nested taxa
- The complexity of inferring a minimally resolved phylogenetic supertree
- Algorithmic Aspects of Tree Amalgamation
- Computing quadratic entropy in evolutionary trees
- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees
- The structure of the overhanging relations associated with some types of closure systems
- scientific article; zbMATH DE number 2089994 (Why is no real title available?)
- Representations of partial leaf sets in phylogenetic tree space
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
- Encoding and constructing 1-nested phylogenetic networks with trinets
This page was built for publication: A supertree method for rooted trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582076)
