Tree-Based Unrooted Phylogenetic Networks

Francis, Andrew, Huber, Katharina and Moulton, Vincent (2018) Tree-Based Unrooted Phylogenetic Networks. Bulletin of Mathematical Biology, 80 (2). 404–416. ISSN 0092-8240

PDF (Published manuscript) - Published Version
Available under License Creative Commons Attribution.

Download (777kB) | Preview


Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An unrooted phylogenetic network on a non-empty, finite set X of taxa, or network, is a connected, simple graph in which every vertex has degree 1 or 3 and whose leaf set is X. It is called a phylogenetic tree if the underlying graph is a tree. In this paper we consider properties of tree-based networks, that is, networks that can be constructed by adding edges into a phylogenetic tree. We show that although they have some properties in common with their rooted analogues which have recently drawn much attention in the literature, they have some striking differences in terms of both their structural and computational properties. We expect that our results could eventually have applications to, for example, detecting horizontal gene transfer or hybridization which are important factors in the evolution of many organisms. Correction available at

Item Type: Article
Additional Information: Correction available at
Uncontrolled Keywords: phylogenetic tree,phylogenetic network,tree-based network,hamiltonian path
Faculty \ School: Faculty of Science > School of Computing Sciences
Depositing User: Pure Connector
Date Deposited: 31 Oct 2017 06:08
Last Modified: 27 Sep 2020 23:51
DOI: 10.1007/s11538-017-0381-3

Actions (login required)

View Item View Item