A quadratic kernel for computing the hybridization number of multiple trees
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2012
- DOI:
- 10.48550/arXiv.1203.4067
- arXiv:
- arXiv:1203.4067
- Bibcode:
- 2012arXiv1203.4067V
- Keywords:
-
- Quantitative Biology - Populations and Evolution