Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves (Q2412994): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963207875 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q91472497 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1506.01091 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:47, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves |
scientific article |
Statements
Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves (English)
0 references
6 April 2018
0 references
tree reconstruction
0 references
graph isomorphism
0 references
phylogenetic diversity
0 references
random tree
0 references
