A quadratic kernel for computing the hybridization number of multiple trees

Leo Van Iersel, Simone Linz

Research output: Contribution to journalArticleScientificpeer-review

15 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)318-323
Number of pages6
JournalInformation Processing Letters
Volume113
Issue number9
DOIs
Publication statusPublished - 2013
Externally publishedYes

Fingerprint Dive into the research topics of 'A quadratic kernel for computing the hybridization number of multiple trees'. Together they form a unique fingerprint.

Cite this