Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution
Andrew Francis, Vincent Moulton

TL;DR
This paper introduces a new probabilistic model for tree-child phylogenetic networks, demonstrating their identifiability and advancing methods for reconstructing complex evolutionary histories with reticulation events.
Contribution
It presents an alternative probabilistic model based on pedigree work, proving identifiability for a broader class of networks called tree-child networks.
Findings
Identifiability of tree-child networks under the new model.
New combinatorial methods for network identification.
Extension of identifiability results to more complex networks.
Abstract
Phylogenetic networks are an extension of phylogenetic trees which are used to represent evolutionary histories in which reticulation events (such as recombination and hybridization) have occurred. A central question for such networks is that of identifiability, which essentially asks under what circumstances can we reliably identify the phylogenetic network that gave rise to the observed data? Recently, identifiability results have appeared for networks relative to a model of sequence evolution that generalizes the standard Markov models used for phylogenetic trees. However, these results are quite limited in terms of the complexity of the networks that are considered. In this paper, by introducing an alternative probabilistic model for evolution along a network that is based on some ground-breaking work by Thatte for pedigrees, we are able to obtain an identifiability result for a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
