Patching up \(X\)-trees (Q1306736): 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/bf01609870 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2578916005 / rank | |||
Normal rank | |||
Latest revision as of 10:46, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Patching up \(X\)-trees |
scientific article |
Statements
Patching up \(X\)-trees (English)
0 references
4 April 2000
0 references
The paper studies the the following fundamental problem: when can one reconstruct a partially labelled tree from some of its subtrees? This problem is well studied in diverse fields that use classification: phylogeny, historical linguistics, and stemmatology. The paper shows that reconstruction from special kinds of subtrees, which have four leaves, is an equivalent problem. This latter problem is completely solved in the case when the number of subtrees on four leaves is as small as possible.
0 references
labelled tree
0 references
subtrees
0 references
reconstruction
0 references
