The Cophylogeny Reconstruction Problem Is NP-Complete

Yaniv Ovadia, Daniel Fielder, Chris Conow, Ran Libeskind-Hadas. The Cophylogeny Reconstruction Problem Is NP-Complete. Journal of Computational Biology, 18(1):59-65, 2011. [doi]

@article{OvadiaFCL11,
  title = {The Cophylogeny Reconstruction Problem Is NP-Complete},
  author = {Yaniv Ovadia and Daniel Fielder and Chris Conow and Ran Libeskind-Hadas},
  year = {2011},
  doi = {10.1089/cmb.2009.0240},
  url = {http://dx.doi.org/10.1089/cmb.2009.0240},
  researchr = {https://researchr.org/publication/OvadiaFCL11},
  cites = {0},
  citedby = {0},
  journal = {Journal of Computational Biology},
  volume = {18},
  number = {1},
  pages = {59-65},
}