Uprooted Phylogenetic Networks

Abstract : 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.
Type de document :
Article dans une revue
Bulletin of Mathematical Biology, Springer Verlag, 2017, 79 (9), pp.2022-2048. 〈10.1007/s11538-017-0318-x〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

Contributeur : Philippe Gambette <>
Soumis le : mardi 1 août 2017 - 11:24:45
Dernière modification le : mercredi 11 avril 2018 - 12:12:03


Publication financée par une institution


Distributed under a Creative Commons Paternité 4.0 International License




Philippe Gambette, Katharina Huber, Guillaume Scholz. Uprooted Phylogenetic Networks. Bulletin of Mathematical Biology, Springer Verlag, 2017, 79 (9), pp.2022-2048. 〈10.1007/s11538-017-0318-x〉. 〈hal-01570943〉



Consultations de la notice


Téléchargements de fichiers