{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:04:44Z","timestamp":1774991084297,"version":"3.50.1"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541301","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"260-264","source":"Crossref","is-referenced-by-count":1,"title":["On the duplication distance of binary strings"],"prefix":"10.1109","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[{"name":"Schools of Mathematics and Computer Science, Tel Aviv University, 6997801, Israel"}]},{"given":"Jehoshua","family":"Bruck","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, California Institute of Technology, Pasadena, 91125, USA"}]},{"given":"Farzad","family":"Farnoud","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, California Institute of Technology, Pasadena, 91125, USA"}]},{"given":"Siddharth","family":"Jain","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, California Institute of Technology, Pasadena, 91125, USA"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/35057062"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282795"},{"key":"ref6","author":"gascuel","year":"2005","journal-title":"Reconstructing the duplication history of tandemly repeated sequences"},{"key":"ref5","first-page":"44","article-title":"Reconstructing the duplication history of a tandem repeat","author":"benson","year":"1999","journal-title":"Ismb"},{"key":"ref8","author":"macwilliams","year":"1977","journal-title":"The Theory of Error Correcting Codes"},{"key":"ref7","article-title":"Uber unendliche zeichenreihen","author":"thue","year":"1906","journal-title":"Norske Vid Selsk Skr I Mat Nat Kl Christiana"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875043"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970029"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875043"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541301.pdf?arnumber=7541301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:53:15Z","timestamp":1774986795000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541301\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541301","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}