Refining phylogenetic trees given additional data: An algorithm based on parsimony

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


Given a set X of taxa, a phylogenetic X-tree T that is only partially resolved, and a collection of characters on X, we consider the problem of finding a resolution (refinement) of T that minimizes the parsimony score of the given characters. Previous work has shown that this problem has a polynomial time solution provided certain strong constraints are imposed on the input. In this paper we provide a new algorithm for this problem, and show that it is fixed parameter tractable under more general conditions.
Original languageEnglish
Pages (from-to)118-125
Number of pages8
JournalIEEE/ACM Transactions on Computational Biology and Bioinformatics
Issue number1
Publication statusPublished - 2009

Cite this