Crossmark

On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model

Published Online: 2017-03-14

Published Print: 2017-12

Authors

Bork, Daniel

Cheng, Ricson

Wang, Jincheng

Sung, Jean

Libeskind-Hadas, Ran http://orcid.org/0000-0001-9120-1948
Funding

Funding for this research was provided by:

National Science Foundation (IIS-1419739)
License Information

Text and Data Mining valid from 2017-03-14

Version of Record valid from 2017-03-14
More Information

Article History

Received: 22 August 2016

Accepted: 5 February 2017

First Online: 14 March 2017

Document is current