A quadratic kernel for computing the hybridization number of multiple trees
Populations and Evolution
2012-03-20 v1
Abstract
It has recently been shown that the NP-hard problem of calculating the minimum number of hybridization events that is needed to explain a set of rooted binary phylogenetic trees by means of a hybridization network is fixed-parameter tractable if an instance of the problem consists of precisely two such trees. In this paper, we show that this problem remains fixed-parameter tractable for an arbitrarily large set of rooted binary phylogenetic trees. In particular, we present a quadratic kernel.
Keywords
Cite
@article{arxiv.1203.4067,
title = {A quadratic kernel for computing the hybridization number of multiple trees},
author = {Leo van Iersel and Simone Linz},
journal= {arXiv preprint arXiv:1203.4067},
year = {2012}
}