{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:36:27Z","timestamp":1768559787539,"version":"3.49.0"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2022,11,1]]},"DOI":"10.1109\/tcbb.2021.3128381","type":"journal-article","created":{"date-parts":[[2021,11,16]],"date-time":"2021-11-16T20:30:24Z","timestamp":1637094624000},"page":"3307-3316","source":"Crossref","is-referenced-by-count":2,"title":["Checking Phylogenetics Decisiveness in Theory and in Practice"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8058-2116","authenticated-orcid":false,"given":"Ghazaleh","family":"Parvini","sequence":"first","affiliation":[{"name":"College of Information & Computer Sciences, University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katherine","family":"Braught","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8563-3637","authenticated-orcid":false,"given":"David","family":"Ferna\u0144dez-Baca","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Iowa State University, Ames, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","article-title":"Gurobi optimizer reference manual","author":"gurobi optimization","year":"2019"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94144-8_26"},{"key":"ref10","article-title":"Supertree construction: Opportunities and challenges","author":"warnow","year":"0","journal-title":"Tech Rep"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2148-10-155"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1186\/s12862-018-1162-9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1126\/science.1206357"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq205"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/2413657"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2009.08.009"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2506583.2512383"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-009-0017-x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-013-0179-4"},{"key":"ref28","volume":"3","author":"sch\u00f6ning","year":"2013","journal-title":"The Satisfiability Problem Algorithms and Analyses"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1126\/science.1253451"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1423041112"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/10635150390235520"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/9781108377737"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1323926111"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-2330-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu033"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.31274\/etd-20210609-143","article-title":"Phylogenetic decisiveness and no-rainbow hypergraph coloring","author":"parvini","year":"2021"},{"key":"ref9","article-title":"Supertree methods for phylogenomics","author":"scornavacca","year":"2009","journal-title":"Dept Comput Sci"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57821-3_17"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","author":"semple","year":"2003","journal-title":"Phylogenetics"},{"key":"ref22","author":"berge","year":"1973","journal-title":"Graphs and Hypergraphs"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974485"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.03.029"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0924-6509(08)70096-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1063\/1.4822863"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470632"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/9976468\/09616390.pdf?arnumber=9616390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T20:30:01Z","timestamp":1722457801000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9616390\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":31,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2021.3128381","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":[[2022,11,1]]}}}