A new polynomial for describing Phylogenetic Networks

Describing phylogenetic trees or networks with a polynomial is a tool to distinguish between them. In this thesis, a new polynomial for describing rooted binary internally labeled phylogenetic networks and trees is introduced based on the research of P. Liu and J. Pons et al. Two different cases are considered, one where the reticulation nodes...

Encoding level-k phylogenetic networks

Phylogenetic networks are used to describe evolutionary histories and are a generalisation of evolutionary trees. They can contain so called reticulations, representing reticulate evolution, such as hybridization, lateral gene transfer and recombination. Methods are being developed to construct certain rooted phylogenetic networks from their...

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...