Who is Who in Phylogenetic Networks

Publication no #2238   Type :   Html | Bib | Both

Created: 2012-08-04 16:40:13     Modified: 2013-06-30 15:08:26

2238 Teresa Piovesan and Steven Kelk. A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees. In TCBB, Vol. 10(1):18-25, 2013. Keywords: FPT, from rooted trees, phylogenetic network, phylogeny, Program TerminusEst, reconstruction. Note: http://arxiv.org/abs/1207.6090.         Toggle abstract "Here, we present a new fixed parameter tractable algorithm to compute the hybridization number (r) of two rooted, not necessarily binary phylogenetic trees on taxon set (X) in time ((6r r) · poly(n)), where (n= |X|). The novelty of this approach is its use of terminals, which are maximal elements of a natural partial order on (X), and several insights from the softwired clusters literature. This yields a surprisingly simple and practical bounded-search algorithm and offers an alternative perspective on the underlying combinatorial structure of the hybridization number problem. © 2004-2012 IEEE." @Article{PiovesanKelk2013,       AUTHOR = {Piovesan, Teresa and Kelk, Steven},       TITLE = {A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees},       YEAR = {2013},       JOURNAL = {TCBB},       VOLUME = {10},       NUMBER = {1},       PAGES = {18-25},       URL = {http://dx.doi.org/10.1109/TCBB.2012.134},       NOTE = {http://arxiv.org/abs/1207.6090},       KEYWORDS = {FPT, from rooted trees, phylogenetic network, phylogeny, Program TerminusEst, reconstruction} }