Not all phylogenetic networks are leaf-reconstructible

DOI10.1007/s00285-019-01405-9zbMath1423.05107arXiv1803.03197OpenAlexW2790268784WikidataQ92301227 ScholiaQ92301227MaRDI QIDQ2330626

Yanyan Li

Publication date: 22 October 2019

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

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

zbMATH Keywords

phylogenetic networksundirected graphsphylogeneticsgraph reconstructionleaf removalUlam's conjecture

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Kernelizations for the hybridization number problem on multiple nonbinary trees
• Fixed-Parameter Algorithms for Maximum Agreement Forests
• Combinatorics of Pedigrees I: Counterexamples to a Reconstruction Question
• Graph reconstruction—a survey
• Leaf-Reconstructibility of Phylogenetic Networks

This page was built for publication: Not all phylogenetic networks are leaf-reconstructible