{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:28:30Z","timestamp":1740144510518,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T00:00:00Z","timestamp":1489449600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T00:00:00Z","timestamp":1489449600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1419739"],"award-info":[{"award-number":["IIS-1419739"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s13015-017-0098-8","type":"journal-article","created":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T02:43:11Z","timestamp":1489459391000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model"],"prefix":"10.1186","volume":"12","author":[{"given":"Daniel","family":"Bork","sequence":"first","affiliation":[]},{"given":"Ricson","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Jincheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jean","family":"Sung","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9120-1948","authenticated-orcid":false,"given":"Ran","family":"Libeskind-Hadas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,14]]},"reference":[{"issue":"3","key":"98_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-4149(82)90011-4","volume":"13","author":"JFC Kingman","year":"1982","unstructured":"Kingman JFC. The coalescent. Stoch Process Appl. 1982;13(3):235\u201348.","journal-title":"Stoch Process Appl"},{"key":"98_CR2","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1101\/gr.123901.111","volume":"22","author":"M Rasmussen","year":"2011","unstructured":"Rasmussen M, Kellis M. Unified modeling of gene duplication, loss, and coalescence using a locus tree. Genome Res. 2011;22:755\u201365.","journal-title":"Genome Res"},{"issue":"3","key":"98_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1101\/gr.161968.113","volume":"24","author":"Y-C Wu","year":"2014","unstructured":"Wu Y-C, Rasmussen MD, Bansal MS, Kellis M. Most parsimonious reconciliation in the presence of gene duplication, loss, and deep coalescence using labeled coalescent trees. Genome Res. 2014;24(3):475\u201386.","journal-title":"Genome Res"},{"issue":"2","key":"98_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0196-6774(03)00073-7","volume":"48","author":"G C-\u0103linescu","year":"2003","unstructured":"C-\u0103linescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J Algorithm. 2003;48(2):333\u201359.","journal-title":"J Algorithm"},{"issue":"12","key":"98_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"MS Bansal","year":"2012","unstructured":"Bansal MS, Alm EJ, Kellis M. Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics. 2012;28(12):283\u201391.","journal-title":"Bioinformatics"},{"issue":"1","key":"98_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1089\/cmb.2009.0240","volume":"18","author":"Y Ovadia","year":"2011","unstructured":"Ovadia Y, Fielder D, Conow C, Libeskind-Hadas R. The cophylogeny reconstruction problem is NP-complete. J Comput Biol. 2011;18(1):59\u201365.","journal-title":"J Comput Biol"},{"issue":"2","key":"98_CR7","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/TCBB.2010.14","volume":"8","author":"A Tofigh","year":"2011","unstructured":"Tofigh A, Hallett MT, Lagergren J. Simultaneous identification of duplications and lateral gene transfers. IEEE\/ACM Trans Comput Biol Bioinform. 2011;8(2):517\u201335.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"98_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness. New York: W. H. Freeman & Co.; 1979."},{"key":"98_CR9","unstructured":"Arora S. Probabilistic checking of proofs and hardness of approximation problems. Ph.D. Thesis, Princeton: Princeton University, Department of Computer Science; 1994"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-017-0098-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13015-017-0098-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-017-0098-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T13:01:56Z","timestamp":1589461316000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-017-0098-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,14]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["98"],"URL":"https:\/\/doi.org\/10.1186\/s13015-017-0098-8","relation":{},"ISSN":["1748-7188"],"issn-type":[{"type":"electronic","value":"1748-7188"}],"subject":[],"published":{"date-parts":[[2017,3,14]]},"assertion":[{"value":"22 August 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"6"}}