Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves (Q1091713): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01894195 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055764798 / rank | |||
Normal rank | |||
Latest revision as of 10:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves |
scientific article |
Statements
Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves (English)
0 references
1986
0 references
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.
0 references
synthesis of rooted trees
0 references
overlapping sets of labeled leaves
0 references
consensus trees
0 references
hierarchical classification
0 references
population classification
0 references
sample classification
0 references
dendrograms
0 references
rooted tree diagrams
0 references
supertree
0 references
consistent sample trees
0 references
algorithm
0 references
consensus supertree
0 references
inconsistent sample trees
0 references
