Patching up \(X\)-trees (Q1306736): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Reconstructing the shape of a tree from observed dissimilarity data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithmic Aspects of Tree Amalgamation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tree structures for proximity data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A few logs suffice to build (almost) all trees (I) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mathematical approaches to comparative linguistics / rank | |||
Normal rank | |||
Revision as of 08:33, 29 May 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
