The cophylogeny reconstruction problem Is NP-complete
Department of Computer Science, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA 91711, United States
The cophylogeny reconstruction problem is that of finding minimum cost explanations of differences between historical associations. The problem arises in parisitology, 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. © Copyright 2011, Mary Ann Liebert, Inc.
Language of original document
coevolution; computational complexity; cophylogeny; NP-completeness
Libeskind-Hadas, R.; Department of Computer Science, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA 91711, United States; email:firstname.lastname@example.org
© Copyright 2011 Elsevier B.V., All rights reserved.
|Journal of Computational Biology|
Volume 18, Issue 1, 1 January 2011, Pages 59-65