A supertree method for rooted trees
From MaRDI portal
Publication:1582076
DOI10.1016/S0166-218X(00)00202-XzbMath0961.05015WikidataQ56764978 ScholiaQ56764978MaRDI QIDQ1582076
Publication date: 21 May 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C05: Trees
92D15: Problems related to evolution
68R10: Graph theory (including graph drawing) in computer science
Related Items
Optimizing phylogenetic supertrees using answer set programming, \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time, Building species trees from larger parts of phylogenomic databases, Improved algorithms for maximum agreement and compatible supertrees, New results on optimizing rooted triplets consistency, Orthology relations, symbolic ultrametrics, and cographs, Encoding and constructing 1-nested phylogenetic networks with trinets, The structure of the overhanging relations associated with some types of closure systems, Computing quadratic entropy in evolutionary trees, On the ancestral compatibility of two phylogenetic trees with nested taxa, Hybridization Number on Three Rooted Binary Trees is EPT, An integrated PCA DEA framework for assessment and ranking of manufacturing systems based on equipment performance, An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees, From Gene Trees to Species Trees through a Supertree Approach
Cites Work
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
- N-trees as nestings: Complexity, similarity, and consensus
- The complexity of reconstructing trees from qualitative characters and subtrees
- An efficient algorithm for supertrees
- Extension operations on sets of leaf-labelled trees
- Reconstruction of rooted trees from subtrees
- Multi-Terminal Network Flows
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
