A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees

We present the first fixed-parameter algorithm for constructing a tree-child phylogenetic network that displays an arbitrary number of binary input trees and has the minimum number of reticulations among all such networks. The algorithm uses the recently introduced framework of cherry picking sequences and runs in O((8 k) ^kpoly (n,...

Combining Networks Using Cherry Picking Sequences

Phylogenetic networks are important for the study of evolution. The number of methods to find such networks is increasing, but most such methods can only reconstruct small networks. To find bigger networks, one can attempt to combine small networks. In this paper, we study the Network Hybridization problem, a problem of combining networks...

Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation

A common problem in phylogenetics is to try to infer a species phylogeny from gene trees. We consider different variants of this problem. The first variant, called Unrestricted Minimal Episodes Inference, aims at inferring a species tree based on a model with speciation and duplication where duplications are clustered in duplication episodes....

High-Performance Motion Control of the METIS Cold Chopper Mechanism

We present the main results of the performance test campaign of the Mid-Infrared European Extremely Large Telescope Imager and Spectrograph (METIS) Cold Chopper Demonstrator (MCCD). This tip/tilt mirror, which operates at a temperature of 77 K, is one of the critical components in the METIS for the European Extremely Large Telescope. The...