A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees
Issue No. 01 - Jan.-Feb. (2013 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2012.134
Teresa Piovesan , Dept. of Knowledge Eng. (DKE), Maastricht Univ., Maastricht, Netherlands
Steven M. Kelk , Dept. of Knowledge Eng. (DKE), Maastricht Univ., Maastricht, Netherlands
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 (6rr!) · 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.
Vegetation, Phylogeny, Clustering algorithms, Polynomials, Silicon, Computational biology, Bioinformatics
T. Piovesan and S. M. Kelk, "A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 1, pp. 18-25, 2013.