Uprooted Phylogenetic Networks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Bulletin of Mathematical Biology Année : 2017

Uprooted Phylogenetic Networks

Résumé

The need for structures capable of accommodating complex evolutionary signals such as those found in, for example, wheat has fueled research into phylogenetic networks. Such structures generalize the standard model of a phylogenetic tree by also allowing for cycles and have been introduced in rooted and unrooted form. In contrast to phylogenetic trees or their unrooted versions, rooted phylogenetic networks are notoriously difficult to understand. To help alleviate this, recent work on them has also centered on their “uprooted” versions. By focusing on such graphs and the combinatorial concept of a split system which underpins an unrooted phylogenetic network, we show that not only can a so-called (uprooted) 1-nested network N be obtained from the Buneman graph (sometimes also called a median network) associated with the split system Σ(N) induced on the set of leaves of N but also that that graph is, in a well-defined sense, optimal. Along the way, we establish the 1-nested analogue of the fundamental “splits equivalence theorem” for phylogenetic trees and characterize maximal circular split systems.
Fichier principal
Vignette du fichier
10.1007-s11538-017-0318-x.pdf (815.06 Ko) Télécharger le fichier
Origine : Publication financée par une institution
Loading...

Dates et versions

hal-01570943 , version 1 (01-08-2017)

Licence

Paternité

Identifiants

Citer

Philippe Gambette, Katharina Huber, Guillaume Scholz. Uprooted Phylogenetic Networks. Bulletin of Mathematical Biology, 2017, 79 (9), pp.2022-2048. ⟨10.1007/s11538-017-0318-x⟩. ⟨hal-01570943⟩
154 Consultations
120 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More