Who is Who in Phylogenetic Networks

Publication no #2198   Type :   Html | Bib | Both

Created: 2012-03-22 00:57:29     Modified: 2013-03-18 17:41:04

2198 Leo van Iersel and Simone Linz. A quadratic kernel for computing the hybridization number of multiple trees. In IPL, Vol. 113:318-323, 2013. Keywords: explicit network, FPT, from rooted trees, kernelization, minimum number, phylogenetic network, phylogeny, Program Clustistic, Program MaafB, Program PIRN, reconstruction. Note: http://arxiv.org/abs/1203.4067, poster.         Toggle 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. © 2013 Elsevier B.V." @Article{IerselLinz2013,       AUTHOR = {van Iersel, Leo and Linz, Simone},       TITLE = {A quadratic kernel for computing the hybridization number of multiple trees},       YEAR = {2013},       JOURNAL = {IPL},       VOLUME = {113},       PAGES = {318-323},       URL = {http://dx.doi.org/10.1016/j.ipl.2013.02.010},       NOTE = {http://arxiv.org/abs/1203.4067, poster},       KEYWORDS = {explicit network, FPT, from rooted trees, kernelization, minimum number, phylogenetic network, phylogeny, Program Clustistic, Program MaafB, Program PIRN, reconstruction} }