Tree-Based Unrooted Nonbinary Phylogenetic Networks
Abstract
Phylogenetic networks are a generalisation of phylogenetic trees that allow for more complex evolutionary histories that include hybridisation-like processes. It is of considerable interest whether a network can be considered `tree-like' or not, which lead to the introduction of \textit{tree-based} networks in the rooted, binary context. Tree-based networks are those networks which can be constructed by adding additional edges into a given phylogenetic tree, called the \textit{base tree}. Previous extensions have considered extending to the binary, unrooted case and the nonbinary, rooted case. We extend tree-based networks to the context of unrooted, nonbinary networks in three ways, depending on the types of additional edges that are permitted. A phylogenetic network in which every embedded tree is a base tree is termed a \textit{fully tree-based} network. We also extend this concept to unrooted, nonbinary phylogenetic networks and classify the resulting networks. We also derive some results on the colourability of tree-based networks, which can be useful to determine whether a network is tree-based.
Cite
@article{arxiv.1711.04935,
title = {Tree-Based Unrooted Nonbinary Phylogenetic Networks},
author = {Michael Hendriksen},
journal= {arXiv preprint arXiv:1711.04935},
year = {2017}
}
Comments
Primarily minor textual changes to improve clarity. Revision of Theorem 4.3 to include star tree case, small corrections to Lemma 5.2 and Theorem 5.3. Added acknowledgements