Refining phylogenetic trees given additional data: an algorithm based on parsimony.
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.
Wu
Taoyang
T
Department of Computer Science and School of Mathematical Sciences, Queen Mary, University of London, London. Taoyang.Wu@dcs.qmul.ac.uk
Moulton
Vincent
V
Steel
Mike
M
D000465:Algorithms; D005075:Biological Evolution; D019295:Computational Biology / Q000379:methods*; D008957:Models, Genetic; D010802:Phylogeny