Minimum-flip supertrees: complexity and algorithms.
The input to a supertree problem is a collection of phylogenetic trees that intersect pairwise in their leaf sets; the goal is to construct a single tree that retains as much as possible of the information in the input. This task is complicated by inconsistencies due to errors. We consider the case where the input trees are rooted and are represented by the clusters they exhibit. The problem is to find the minimum number of flips needed to resolve all inconsistencies, where each flip moves a taxon into or out of a cluster. We prove that the minimum-flip problem is NP-complete, but show that it is fixed-parameter tractable and give approximation algorithms for special cases.
Chen
Duhong
D
Department of Computer Science, Iowa State University, Ames, IA 50011-1040, USA. jackie@iastate.edu
Eulenstein
Oliver
O
Fernandez-Baca
David
D
Sanderson
Michael
M
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D019143:Evolution, Molecular; D008957:Models, Genetic; D010802:Phylogeny