Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
type: Item
instance of: scholarly article
title: Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
zbMATH Open document ID: 0623.62051
DOI: 10.1007/BF01894195
author: B. George
published in: Journal of Classification
publication date: 1986-01-01T00:00:00Z
review text: Given two dendrograms (rooted tree diagrams) which have some but not all of their base points in common, a supertree is a dendrogram from which each of the original trees can be regarded as samples. The distinction is made between inconsistent and consistent sample trees, defined by whether or not the samples provide contradictory information about the supertree. An algorithm for obtaining the strict consensus supertree of two consistent sample trees is presented, as are procedures for merging two inconsistent sample trees. Some suggestions for future work are made.
Mathematics Subject Classification ID: 62H30
zbMATH DE Number: 4011681
zbMATH Keywords: synthesis of rooted trees
zbMATH Keywords: overlapping sets of labeled leaves
zbMATH Keywords: consensus trees
zbMATH Keywords: hierarchical classification
zbMATH Keywords: population classification
zbMATH Keywords: sample classification
zbMATH Keywords: dendrograms
zbMATH Keywords: rooted tree diagrams
zbMATH Keywords: supertree
zbMATH Keywords: consistent sample trees
zbMATH Keywords: algorithm
zbMATH Keywords: consensus supertree
zbMATH Keywords: inconsistent sample trees
Wikidata QID: Q56569464
MaRDI profile type: Publication
cites work: Optimal algorithms for comparing trees with labeled leaves
cites work: The probabilities of rooted tree-shapes generated by random bifurcation
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: Consensus n-trees
cites work: Counting dendrograms: A survey
cites work: Faithful consensus methods for n-trees
cites work: Q5667364
cites work: s-consensus trees and indices
full work available at URL: https://doi.org/10.1007/bf01894195
OpenAlex ID: W2055764798
Recommended article: Combinatorial Pattern Matching
Recommended article: A supertree method for rooted trees
Recommended article: Q4608616
Recommended article: Computing a consensus of multilabeled trees
Recommended article: A Class of General Supertree Methods for Nested Taxa
Recommended article: Identifying consensus of trees through alignment
Recommended article: Rooted maximum agreement supertrees
description: scientific article; zbMATH DE number 4011681