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

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

Daniel Lanoue, Steven N. Evans

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 isomorphismrandom treephylogenetic diversitytree reconstruction

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Graph reconstruction from path correlation data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proper caterpillars are distinguished by their chromatic symmetric function
• Graphs with equal chromatic symmetric functions
• Spectra of large random trees
• A congruence theorem for trees
• Some uses of the Farris transform in mathematics and phylogenetics -- A review
• The reconstruction of a tree from its number deck
• Proof of Harary's conjecture on the reconstruction of trees
• Reconstructing trees from subtree weights.
• A symmetric function generalization of the chromatic polynomial of a graph
• A note on the metric properties of trees
• Cyclic permutations and evolutionary trees
• A note on tree isomorphisms
• Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005.
• On distinguishing trees by their chromatic symmetric functions
• Non-isomorphic caterpillars with identical subtree data
• Almost all trees share a complete set of immanantal polynomials
• Patterns and pattern-matching in trees: An analysis
• A Greedoid Polynomial Which Distinguishes Rooted Arborescences
• The graph isomorphism disease
• The Structure of Homometric Sets
• The Reconstruction of a Tree from its Maximal Subtrees
• A note on the tree realizability of a distance matrix
• Generalized Matrix Functions and the Graph Isomorphism Problem
• Reconstruction of Trees

This page was built for publication: Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves