http://barf.jcowboy.org Journal of Computational Biology recent publications en-us http://barf.jcowboy.org/pubmed.gif http://barf.jcowboy.org http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?cmd=Retrieve&db=PubMed&dopt=Abstract&list_uids=20715926 Publication Date: 2010 Aug 17 PMID: 20715926<br/>Authors: Ovadia, Y. - Fielder, D. - Conow, C. - Libeskind-Hadas, R.<br/>Journal: J Comput Biol<br/><br/>Abstract 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.<br/><br/>post to: <a href = "http://www.citeulike.org/posturl?url=http%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fentrez%2Fquery.fcgi%3Fcmd%3DRetrieve%26db%3DPubMed%26dopt%3DAbstract%26list_uids%3D20715926&title=Entrez+Pubmed">CiteULike</a>