A Simple Fixed Parameter Tractable Algor
✍
Piovesan, Teresa; Kelk, Steven M.
📂
Article
📅
2013
🏛
IEEE
🌐
English
⚖ 243 KB
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 ¼ jXj. The novelty of this approach is its use of terminals, which are maximal elements of a na