An efficient algorithm for supertrees

DOI10.1007/BF01202270MaRDI QIDQ1901397zbMATH OpenOpenAlexFDO

Authors 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) Software, source code, etc. for problems pertaining to biology (92-04) Computational methods for problems pertaining to biology (92-08)

Recommendations

• A supertree method for rooted trees
• scientific article; zbMATH DE number 1746436
• Reconstructing minimal rooted trees.
• Rooted maximum agreement supertrees
• LATIN 2004: Theoretical Informatics

Cites work

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

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901397)