Computing Measures for Tree-Basedness of Phylogenetic Networks

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<br/>lacks such events it is a phylogenetic tree. Some phylogenetic networks that are not trees can<br/>however be represented as a tree with additional...

Tree-child Network Containment

Interest in phylogenetic trees for histories of species and DNA has spawned many problems, one of which is TreeContainment; a problem that asks whether a tree is contained within a network. The TreeContainment problem is proven to be NP-hard for general trees and networks, however it is solvable in polynomial time for networks that meet the tree...

Tail move rearrangement algorithm for rooted binary phylogenetic networks

A common tool for exploring the space of phylogenetic networks is applying rearrangement moves, such as <i>tail moves</i>. Recently, it has been shown by Janssen et al that, given a rooted binary phylogenetic network, it is possible to generate any other alternative network, using only tail moves. The aim of this report is to translate this...