Issue No. 01 - January-March (2009 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.100
Taoyang Wu , Queen Mary, University of London, London
Vincent Moulton , University of East Anglia, Norwich
Mike Steel , University of Canterbury, Christchurch
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.
Combinatorial algorithms, Life and Medical Sciences
T. Wu, M. Steel and V. Moulton, "Refining Phylogenetic Trees Given Additional Data: An Algorithm Based on Parsimony," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 6, no. , pp. 118-125, 2008.