A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees

Teresa Piovesan, Steven Kelk

Research output: Contribution to journalArticleAcademicpeer-review

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 (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.
Original languageEnglish
Pages (from-to)18-25
Number of pages8
JournalIEEE ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Volume10
Issue number1
DOIs
Publication statusPublished - 2013

Cite this