An efficient algorithm for supertrees

DOI10.1007/BF01202270zbMath0829.92013OpenAlexW1993092519MaRDI QIDQ1901397

Mariana Constantinescu, David Sankoff

Publication date: 14 November 1995

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202270

zbMATH Keywords

algorithmrooted binary treessupertreescommon ancestorslabeled leavesconsensus treestree compatibilitylineage constraints

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85) Computational methods for problems pertaining to biology (92-08) Software, source code, etc. for problems pertaining to biology (92-04)

Related Items (5)

Counting consistent phylogenetic trees is \#P-complete ⋮ Reconstruction of rooted trees from subtrees ⋮ The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees ⋮ Reconstructing minimal rooted trees. ⋮ A supertree method for rooted trees

Cites Work

• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
• Tree enumeration modulo a consensus
• Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions

This page was built for publication: An efficient algorithm for supertrees