Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves

DOI10.1016/j.aam.2018.01.001zbMath1383.05052arXiv1506.01091WikidataQ91472497 ScholiaQ91472497MaRDI QIDQ2412994

Steven N. Evans, Daniel Lanoue

Publication date: 6 April 2018

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.01091

zbMATH Keywords

graph isomorphism; random tree; phylogenetic diversity; tree reconstruction

Mathematics Subject Classification ID

05C05: Trees

05C80: Random graphs (graph-theoretic aspects)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)