N-trees as nestings: Complexity, similarity, and consensus (Q1104670): 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/bf01894192 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2022293103 / rank | |||
Normal rank |
Latest revision as of 08:26, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | N-trees as nestings: Complexity, similarity, and consensus |
scientific article |
Statements
N-trees as nestings: Complexity, similarity, and consensus (English)
0 references
1986
0 references
The paper examines three interpretations of a tree as a set (clusters, triads, nestings). Subset nesting is preferred over the clusters and even the triads interpretations because of its superior expression of shared structure. For the nestings interpretation are defined measures of complexity, similarity measures and a normalized consensus index. The ``full consensus'' tree is defined while guaranteeing that its nondisjoint clusters bear the nesting relation in each tree of the profile. The full consensus is proved to exist uniquely and to equal the Adams consensus.
0 references
Adams-2 consensus
0 references
strict consensus
0 references
rooted trees
0 references
taxonomic tree
0 references
clusters
0 references
triads
0 references
nestings
0 references
measures of complexity
0 references
similarity measures
0 references
normalized consensus index
0 references
full consensus
0 references
Adams consensus
0 references