An efficient algorithm for supertrees (Q1901397): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tree enumeration modulo a consensus / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01202270 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993092519 / rank | |||
Normal rank | |||
Latest revision as of 10:21, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for supertrees |
scientific article |
Statements
An efficient algorithm for supertrees (English)
0 references
14 November 1995
0 references
tree compatibility
0 references
supertrees
0 references
consensus trees
0 references
rooted binary trees
0 references
labeled leaves
0 references
lineage constraints
0 references
common ancestors
0 references
algorithm
0 references
0 references
