A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees

作者：Piovesan Teresa^*; Kelk Steven M

来源：IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2013, 10(1): 18-25.

DOI：10.1109/TCBB.2012.134

• Phylogenetic network
• fixed parameter tractability
• nonbinary

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 (6(r)r!).poly(n), where n = vertical bar X vertical bar. 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.

• 出版日期2013-2