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]

Authors

Yaniv Ovadia

This author has not been identified. Look up 'Yaniv Ovadia' in Google

Daniel Fielder

This author has not been identified. Look up 'Daniel Fielder' in Google

Chris Conow

This author has not been identified. Look up 'Chris Conow' in Google

Ran Libeskind-Hadas

This author has not been identified. Look up 'Ran Libeskind-Hadas' in Google