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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01570943
Contributor : Philippe Gambette <>
Submitted on : Tuesday, August 1, 2017 - 11:24:45 AM
Last modification on : Thursday, July 5, 2018 - 2:45:44 PM

File

10.1007-s11538-017-0318-x.pdf
Publication funded by an institution

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

232

Files downloads

124