Planar phylogenetic networks

Moulton, Vincent and Wu, Taoyang (2022) Planar phylogenetic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics. ISSN 1545-5963

[img]
Preview
PDF (2203.10156) - Accepted Version
Download (614kB) | Preview

Abstract

A phylogenetic network is a rooted, directed acyclic graph, with a single root, whose sinks correspond to a set of species. Such networks are commonly used to represent the evolution of species that have undergone reticulate evolution. Recently, there has been great interest in developing the theory behind and algorithms for constructing such networks. One issue with phylogenetic networks is that, unlike rooted evolutionary trees, they can be highly non-planar (i.e. it is not possible to draw them in the plane without some arcs crossing). This can make them difficult to visualise and interpret. In this paper we investigate properties of planar phylogenetic networks and algorithms for deciding whether or not phylogenetic networks have certain special planarity properties. In particular, as well as defining some natural subclasses of planar phylogenetic networks and working out their interrelationships, we characterize when the well-known level-k networks are planar as well as showing that planar regular networks are closely related to pyramids. Our results make use of the highly developed field of planar digraphs, and we believe that the link between phylogenetic networks and this field should prove useful in future for developing new approaches to both construct and visualise phylogenetic networks.

Item Type: Article
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: LivePure Connector
Date Deposited: 10 Jun 2022 14:32
Last Modified: 05 Jul 2022 00:19
URI: https://ueaeprints.uea.ac.uk/id/eprint/85514
DOI: 10.1109/TCBB.2022.3185670

Actions (login required)

View Item View Item