A supertree method for rooted trees

DOI10.1016/S0166-218X(00)00202-XzbMath0961.05015OpenAlexW2033854905WikidataQ56764978 ScholiaQ56764978MaRDI QIDQ1582076

Charles Semple, Mike A. 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

zbMATH Keywords

supertreerooted phylogenetic treeconsensus tree

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10)

Related Items (20)

Site pattern probabilities under the multispecies coalescent and a relaxed molecular clock: theory and applications ⋮ Encoding and constructing 1-nested phylogenetic networks with trinets ⋮ Reconstructing phylogenetic trees from multipartite quartet systems ⋮ The structure of the overhanging relations associated with some types of closure systems ⋮ \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time ⋮ Optimizing phylogenetic supertrees using answer set programming ⋮ An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees ⋮ Orthology relations, symbolic ultrametrics, and cographs ⋮ A distance-based model for convergent evolution ⋮ Improved algorithms for maximum agreement and compatible supertrees ⋮ Computing quadratic entropy in evolutionary trees ⋮ On the ancestral compatibility of two phylogenetic trees with nested taxa ⋮ Building species trees from larger parts of phylogenomic databases ⋮ New results on optimizing rooted triplets consistency ⋮ An integrated PCA DEA framework for assessment and ranking of manufacturing systems based on equipment performance ⋮ Unnamed Item ⋮ From Gene Trees to Species Trees through a Supertree Approach ⋮ Hybridization Number on Three Rooted Binary Trees is EPT ⋮ MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms ⋮ Complexity and algorithms for MUL-tree pruning

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

This page was built for publication: A supertree method for rooted trees