Leaf-Reconstructibility of Phylogenetic Networks

DOI10.1137/17M1111930zbMath1392.05104arXiv1701.08982MaRDI QIDQ4579954

Leo van Iersel, Vincent L. Moulton

Publication date: 10 August 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

reconstruction conjecturephylogenetic treephylogenetic networkgraph reconstruction

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40)

Related Items (9)

Combining Networks Using Cherry Picking Sequences ⋮ Reconstructing Words from Right-Bounded-Block Words ⋮ Counting phylogenetic networks of level 1 and 2 ⋮ Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes ⋮ Tree-based unrooted phylogenetic networks ⋮ Quarnet inference rules for level-1 networks ⋮ Rigidity and reconstruction for graphs ⋮ Not all phylogenetic networks are leaf-reconstructible ⋮ Reconstructing Words from Right-Bounded-Block Words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• Reconstructing pedigrees: a stochastic perspective
• Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model
• Trinets encode tree-child and level-2 phylogenetic networks
• Encoding and constructing 1-nested phylogenetic networks with trinets
• Combinatorics of Pedigrees I: Counterexamples to a Reconstruction Question
• Almost every graph has reconstruction number three
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey
• The Reconstruction of a Tree from its Maximal Subtrees

This page was built for publication: Leaf-Reconstructibility of Phylogenetic Networks