A supertree method for rooted trees
From MaRDI portal
Publication:1582076
DOI10.1016/S0166-218X(00)00202-XzbMATH Open0961.05015DBLPjournals/dam/SempleS00OpenAlexW2033854905WikidataQ56764978 ScholiaQ56764978MaRDI QIDQ1582076FDOQ1582076
Authors: Charles Semple, Mike Steel 
Publication date: 21 May 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00202-x
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
Problems related to evolution (92D15) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- The complexity of reconstructing trees from qualitative characters and subtrees
- Multi-Terminal Network Flows
- 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
- N-trees as nestings: Complexity, similarity, and consensus
- Reconstruction of rooted trees from subtrees
- An efficient algorithm for supertrees
Cited In (39)
- Constructing rooted supertrees using distances
- Title not available (Why is that?)
- Exponentially many supertrees
- New results on optimizing rooted triplets consistency
- A distance-based model for convergent evolution
- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
- Building species trees from larger parts of phylogenomic databases
- Complexity and algorithms for MUL-tree pruning
- From subtrees to supertrees
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Finding smallest supertrees
- Site pattern probabilities under the multispecies coalescent and a relaxed molecular clock: theory and applications
- The complexity of inferring a minimally resolved phylogenetic supertree
- Title not available (Why is that?)
- Computing quadratic entropy in evolutionary trees
- Hybridization number on three rooted binary trees is EPT
- Finding smallest supertrees under minor containment
- Representations of partial leaf sets in phylogenetic tree space
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
- Orthology relations, symbolic ultrametrics, and cographs
- Title not available (Why is that?)
- Algorithmic Aspects of Tree Amalgamation
- 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
- Improved algorithms for maximum agreement and compatible supertrees
- Explosions and hot spots in supertree methods
- Title not available (Why is that?)
- Reconstructing phylogenetic trees from multipartite quartet systems
- Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees
- Optimizing phylogenetic supertrees using answer set programming
- Title not available (Why is that?)
- From Gene Trees to Species Trees through a Supertree Approach
- Extending the limits of supertree methods
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
- MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms
- FlipCut supertrees: towards matrix representation accuracy in polynomial time
- An integrated PCA DEA framework for assessment and ranking of manufacturing systems based on equipment performance
- An efficient algorithm for supertrees
- On the ancestral compatibility of two phylogenetic trees with nested taxa
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)
