{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:33:00Z","timestamp":1771036380051,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["#1461094"],"award-info":[{"award-number":["#1461094"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["#1847271"],"award-info":[{"award-number":["#1847271"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["#1461094"],"award-info":[{"award-number":["#1461094"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1847271"],"award-info":[{"award-number":["DMS-1847271"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2021,11,1]]},"DOI":"10.1109\/tcbb.2020.3040910","type":"journal-article","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T20:51:06Z","timestamp":1606423866000},"page":"2823-2827","source":"Crossref","is-referenced-by-count":2,"title":["Maximum Covering Subtrees for Phylogenetic Networks"],"prefix":"10.1109","volume":"18","author":[{"given":"Nathan","family":"Davidov","sequence":"first","affiliation":[]},{"given":"Amanda","family":"Hernandez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2585-5537","authenticated-orcid":false,"given":"Justin","family":"Jian","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"McKenna","sequence":"additional","affiliation":[]},{"given":"K.A.","family":"Medlin","sequence":"additional","affiliation":[]},{"given":"Roadra","family":"Mojumder","sequence":"additional","affiliation":[]},{"given":"Megan","family":"Owen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6673-4934","authenticated-orcid":false,"given":"Andrew","family":"Quijano","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8098-1096","authenticated-orcid":false,"given":"Amanda","family":"Rodriguez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1657-8301","authenticated-orcid":false,"given":"Katherine","family":"St. John","sequence":"additional","affiliation":[]},{"given":"Katherine","family":"Thai","sequence":"additional","affiliation":[]},{"given":"Meliza","family":"Uraga","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2017.08.003"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/syv037"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-017-9776-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.03.036"},{"key":"ref14","article-title":"A structure theorem for rooted binary phylogenetic networks and its implications for tree-based networks","author":"hayamizu","year":"2018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.mbs.2018.06.005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2016.2615918"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.04.019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557077"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.10.015"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2015.0228"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11538-016-0169-x"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.07.027"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.48"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"ref7","article-title":"Network flow theory","author":"ford jr","year":"1956"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/070710494"},{"key":"ref1","author":"ahuja","year":"1963","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11538-017-0381-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384247"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00285-018-1296-9"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322047.322048","article-title":"Finding two disjoint paths between two pairs of vertices in a graph","volume":"25","author":"perl","year":"1978","journal-title":"J ACM"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s11538-015-0132-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/11604686_28"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140209"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8857\/9642421\/9272681-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/9642421\/09272681.pdf?arnumber=9272681","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\/9272681\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,1]]},"references-count":28,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2020.3040910","relation":{},"ISSN":["1545-5963","1557-9964","2374-0043"],"issn-type":[{"value":"1545-5963","type":"print"},{"value":"1557-9964","type":"electronic"},{"value":"2374-0043","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,1]]}}}