Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves (Q2412994): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.aam.2018.01.001 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/aam/EvansL18 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AAM.2018.01.001 / rank | |||
Normal rank | |||
Latest revision as of 11:50, 18 December 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
