Uprooted phylogenetic networks

Gambette, Philippe, Huber, Katharina T. and Scholz, Guillaume E. (2017) Uprooted phylogenetic networks. Bulletin of Mathematical Biology, 79 (9). 2022–2048. ISSN 0092-8240

[thumbnail of Published manuscript]
Preview
PDF (Published manuscript) - Published Version
Available under License Creative Commons Attribution.

Download (834kB) | Preview

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)Σ(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.

Item Type: Article
Uncontrolled Keywords: phylogenetic network,buneman graph,circular split system,closure,median network,pc-trees
Faculty \ School: Faculty of Science > School of Computing Sciences
Faculty of Science
UEA Research Groups: Faculty of Science > Research Groups > Computational Biology > Phylogenetics (former - to 2018)
Faculty of Science > Research Groups > Computational Biology
Depositing User: Pure Connector
Date Deposited: 03 Jun 2017 05:07
Last Modified: 14 Jun 2023 12:59
URI: https://ueaeprints.uea.ac.uk/id/eprint/63665
DOI: 10.1007/s11538-017-0318-x

Actions (login required)

View Item View Item