Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves

DOI10.1007/BF01894195zbMath0623.62051OpenAlexW2055764798WikidataQ56569464 ScholiaQ56569464MaRDI QIDQ1091713

B. George

Publication date: 1986

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

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

zbMATH Keywords

algorithmsupertreehierarchical classificationdendrogramsconsensus supertreeconsensus treesconsistent sample treesinconsistent sample treesoverlapping sets of labeled leavespopulation classificationrooted tree diagramssample classificationsynthesis of rooted trees

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (18)

Compatibility of unrooted phylogenetic trees is FPT ⋮ Partial dissimilarities with application to clustering ⋮ Some axiomatic limitations for consensus and supertree functions on hierarchies ⋮ An efficient algorithm for supertrees ⋮ Tree enumeration modulo a consensus ⋮ Mathematical aspects of phylogenetic groves ⋮ Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees ⋮ Majority-rule (+) consensus trees ⋮ Improved algorithms for maximum agreement and compatible supertrees ⋮ Graph triangulations and the compatibility of unrooted phylogenetic trees ⋮ Piecewise hierarchical clustering ⋮ Maximum agreement and compatible supertrees ⋮ Unique Perfect Phylogeny Is NP-Hard ⋮ The complexity of reconstructing trees from qualitative characters and subtrees ⋮ An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex ⋮ Fixed-Parameter Algorithms for Finding Agreement Supertrees ⋮ An improved bound on the maximum agreement subtree problem ⋮ A supertree method for rooted trees

Cites Work

• Counting dendrograms: A survey
• Faithful consensus methods for n-trees
• s-consensus trees and indices
• Optimal algorithms for comparing trees with labeled leaves
• Consensus n-trees
• The Complexity of Some Problems on Subsequences and Supersequences
• The probabilities of rooted tree-shapes generated by random bifurcation
• Unnamed Item

This page was built for publication: Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves