{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:40:28Z","timestamp":1757540428447},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"US National Science Foundation","award":["IIS-1419739"],"award-info":[{"award-number":["IIS-1419739"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2018,3,1]]},"DOI":"10.1109\/tcbb.2016.2537319","type":"journal-article","created":{"date-parts":[[2016,3,2]],"date-time":"2016-03-02T19:11:31Z","timestamp":1456945891000},"page":"411-421","source":"Crossref","is-referenced-by-count":10,"title":["DTL-RnB: Algorithms and Tools for Summarizing the Space of DTL Reconciliations"],"prefix":"10.1109","volume":"15","author":[{"given":"W.","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Smirnov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Forman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Schweickart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Slocum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Libeskind-Hadas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1111\/j.1366-9516.2006.00210.x"},{"key":"ref11","article-title":"Using trees to capture reticulate evolution: Lateral gene\n transfers and cancer progression","author":"tofigh","year":"2009"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2009.0240"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.A010"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S0219720012500254"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0073667"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu289"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu806"},{"key":"ref19","author":"rasmussen","year":"0"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1186\/1748-7188-5-16","article-title":"Jane: A new tool for cophylogeny\n reconstruction problem","volume":"5","author":"conow","year":"2010","journal-title":"Algorithms Molecular Biology"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2005.08.006"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16181-0_9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nature09649"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2008.0084"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2010.14"},{"key":"ref2","first-page":"1","article-title":"Reconciliation revisited: handling multiple optima when reconciling with duplication, transfer, and loss","author":"bansal","year":"0","journal-title":"Research in Computational Molecular Biology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts225"},{"key":"ref9","article-title":"Faster dynamic programming algorithms for the\n cophylogeny reconstruction problem","author":"yodpinyanee","year":"2011"},{"key":"ref20","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/8857\/8329158\/7423775-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/8329158\/07423775.pdf?arnumber=7423775","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:51:24Z","timestamp":1649443884000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7423775\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,1]]},"references-count":20,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2016.2537319","relation":{},"ISSN":["1545-5963"],"issn-type":[{"value":"1545-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3,1]]}}}