{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T18:50:10Z","timestamp":1779907810342,"version":"3.53.1"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NWO","award":["TOP grant 2013"],"award-info":[{"award-number":["TOP grant 2013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2017,3,1]]},"DOI":"10.1109\/tcbb.2016.2543727","type":"journal-article","created":{"date-parts":[[2016,3,17]],"date-time":"2016-03-17T18:17:46Z","timestamp":1458238666000},"page":"472-477","source":"Crossref","is-referenced-by-count":2,"title":["A Linear Bound on the Number of States in Optimal Convex Characters for Maximum Parsimony Distance"],"prefix":"10.1109","volume":"14","author":[{"given":"Olivier","family":"Boes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mareike","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-001-8006-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(81)90043-2"},{"key":"ref10","article-title":"Calculating the unrooted Subtree Prune-and-Regraft distance","author":"whidden","year":"0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2015.02.002"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-015-0298-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-017-0361-1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2307\/2412116"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/syu085"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/110845045"},{"key":"ref1","author":"huson","year":"2011","journal-title":"Phylogenetic Networks Concepts Algorithms and Applications"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/7887773\/07435288.pdf?arnumber=7435288","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:19:59Z","timestamp":1642004399000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7435288\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,1]]},"references-count":10,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2016.2543727","relation":{},"ISSN":["1545-5963"],"issn-type":[{"value":"1545-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2017,3,1]]}}}