title: The co phylogeny reconstruction problem is NP-complete.
abstract: The co phylogeny reconstruction problem is that of finding minimum cost explanations of differences between historical associations. The problem arises in parasitology, molecular systematics, and biogeography. Existing software tools for this problem either have worst-case exponential time or use heuristics that do not guarantee optimal solutions. To date, no polynomial time optimal algorithms have been found for this problem. In this article, we prove that the problem is NP-complete, suggesting that future research on algorithms for this problem should seek better polynomial-time approximation algorithms and heuristics rather than optimal solutions.
authors: Department of Computer Science, Harvey Mudd College, Claremont, California 91711, USA.
authors: Y
authors: Y
authors: Ovadia
authors: D
authors: D
authors: Fielder
authors: C
authors: C
authors: Conow
authors: R
authors: R
authors: Libeskind-Hadas
mesh_terms: D000465:Algorithms; D000818:Animals; D005075:Biological Evolution; D003198:Computer Simulation; D006790:Host-Parasite Interactions / Q000235:genetics; D008954:Models, Biological; D010271:Parasites / Q000235:genetics; D010802:Phylogeny