Computing Measures for Tree-Basedness of Phylogenetic Networks
Arthur Mooiman (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Leo van Iersel – Mentor
Jeroen Spandaw – Graduation committee member
Klaas Pieter Hart – Graduation committee member
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Phylogenetic networks are a type of directed acyclic graph used to represent evolutionary relationships that contain events such as hybridization or horizontal gene transfer. When a network
lacks such events it is a phylogenetic tree. Some phylogenetic networks that are not trees can
however be represented as a tree with additional linking arcs, e.g. representing transfer of genetic
materials. We have implemented an algorithm that can be used to determine whether a given
network is tree-based or not. Moreover if the network is not tree-based, the algorithm shows
how it can be made tree-based by adding a minimum number of additional leaves, representing
possible extinct or un-sampled species. We also describe the theory behind the algorithm and
apply it to several synthetic as well as biological datasets.