Identifiability of phylogenetic networks

Abstract : Phylogenies are almost invariably represented as trees. Although in many cases this is reasonable, in many others phylogenies should be represented as networks (more precisely directed acyclic graphs). This is due to a number of biological phenomena collectively known as reticulation events, whereby a species or a gene inherits genetic material from more than one parent organism. This may be caused by events such as hybrid speciation, introgression, horizontal gene transfer, or recombination. Phylogenetic network inference methods are in their infancy, but they are almost invariably based on the following idea: the goodness of a candidate network is evaluated on the basis of how well the trees it contains fit the data. This poses a problem: different networks may contain exactly the same set of trees, meaning that these networks will be considered "indistinguishable" by most network inference methods, no matter the input data. We propose a novel definition of what constitutes a "uniquely reconstructible" network: for each class of indistinguishable networks, we define a canonical form. Under mild assumptions, the canonical form is unique. Given data coming from any phylogenetic network, only its canonical equivalent can be uniquely reconstructed. This is a fundamental limitation that implies a drastic reduction of the solution space in phylogenetic network inference.
Document type :
Conference papers
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01237418
Contributor : Fabio Pardi <>
Submitted on : Thursday, December 3, 2015 - 12:04:28 PM
Last modification on : Friday, June 21, 2019 - 1:26:53 AM

Identifiers

  • HAL Id : lirmm-01237418, version 1

Collections

Citation

Fabio Pardi, Celine Scornavacca. Identifiability of phylogenetic networks. MCEB: Mathematical and Computational Evolutionary Biology, Jun 2014, Hameau de l'Etoile, St Martin de Londres, France. ⟨lirmm-01237418⟩

Share

Metrics

Record views

269