{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:11:12Z","timestamp":1750824672364,"version":"3.41.0"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF Expeditions in Computing Program (The Molecular Programming Project)"},{"name":"USA-Israeli BSF","award":["2012\/107"],"award-info":[{"award-number":["2012\/107"]}]},{"name":"ISF","award":["620\/13"],"award-info":[{"award-number":["620\/13"]}]},{"name":"Israeli I-Core Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/tit.2017.2730864","type":"journal-article","created":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T18:49:07Z","timestamp":1501094947000},"page":"7793-7803","source":"Crossref","is-referenced-by-count":13,"title":["Duplication Distance to the Root for Binary Sequences"],"prefix":"10.1109","volume":"63","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[]},{"given":"Farzad","family":"Farnoud Hassanzadeh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9164-6119","authenticated-orcid":false,"given":"Siddharth","family":"Jain","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"904","article-title":"A stochastic model for genomic interspersed duplication","author":"farnoud (hassanzadeh)","year":"2015","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541455"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970029"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(74)90041-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-5193(68)90080-5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8476-2"},{"key":"ref4","first-page":"44","article-title":"Reconstructing the duplication history of a tandem repeat","author":"benson","year":"1999","journal-title":"Proc ISMB"},{"key":"ref3","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de bruijn","year":"1946","journal-title":"Proc Sec Sci Koninklijke Nederlandse Akademie Wetenschappen Amsterdam"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198566106.001.0001","author":"gascuel","year":"2005","journal-title":"Mathematics of Evolution and Phylogeny"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1089\/10665270252935557"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282795"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2505735"},{"journal-title":"Über Unendliche Zeichenreihen","year":"1906","author":"thue","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/35057062"},{"key":"ref9","first-page":"270","article-title":"The capacity of some Pólya string models","author":"elishco","year":"2016","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/8114709\/7993073-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8114709\/07993073.pdf?arnumber=7993073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T18:14:18Z","timestamp":1750788858000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7993073\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":17,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2730864","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2017,12]]}}}