Bioinformatics regularly poses new challenges to algorithm engineers and theoretical
computer scientists. This work surveys recent developments of parameterized algorithms …

In order to gain an understanding of the effectiveness of phylogenetic Markov chain Monte
Carlo (MCMC), it is important to understand how quickly the empirical distribution of the …

Influenza B viruses make a considerable contribution to morbidity attributed to seasonal
influenza. Currently circulating influenza B isolates are known to belong to two antigenically …

Comparing two or more phylogenetic trees is a fundamental task in computational biology.
The simplest outcome of such a comparison is a pairwise measure of similarity, dissimilarity …

A phylogenetic network is a model for reticulate evolution. A hybridization network is one
type of phylogenetic network for a set of discordant gene trees and “displays” each gene …

Supertree methods reconcile a set of phylogenetic trees into a single structure that is often
interpreted as a branching history of species. A key challenge is combining conflicting …

We present new and improved fixed-parameter algorithms for computing maximum
agreement forests of pairs of rooted binary phylogenetic trees. The size of such a forest for …

Motivation: Hybridization events in evolution may lead to incongruent gene trees. One
approach to determining possible interspecific hybridization events is to compute a …

We improve on earlier FPT algorithms for computing a rooted maximum agreement forest
(MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their …

The hybridization number problem requires us to embed a set of binary rooted phylogenetic
trees into a binary rooted phylogenetic network such that the number of nodes with indegree …