{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:35:49Z","timestamp":1774020949035,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF Graduate Research Fellowship Program"},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1527130"],"award-info":[{"award-number":["CCF-1527130"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1109\/tit.2017.2649493","type":"journal-article","created":{"date-parts":[[2017,1,9]],"date-time":"2017-01-09T21:42:12Z","timestamp":1483998132000},"page":"2428-2445","source":"Crossref","is-referenced-by-count":76,"title":["Exact Reconstruction From Insertions in Synchronization Codes"],"prefix":"10.1109","volume":"63","author":[{"given":"Frederic","family":"Sala","sequence":"first","affiliation":[]},{"given":"Ryan","family":"Gabrys","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9519-5143","authenticated-orcid":false,"given":"Clayton","family":"Schoeny","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3736-4345","authenticated-orcid":false,"given":"Lara","family":"Dolecek","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.081204"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284242"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541568"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90442-2"},{"key":"ref36","author":"wilf","year":"1990","journal-title":"Generatingfunctionology"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2552175"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2466635"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290045"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2508800"},{"key":"ref12","author":"farnoud","year":"2016","journal-title":"Estimating Mutation Rates and Sequence age Under a Stochastic Model for Tandem Duplication and Point Mutation"},{"key":"ref13","first-page":"44","article-title":"Reconstructing the duplication history of a tandem repeat","author":"benson","year":"1999","journal-title":"Proc Int Conf Intell Syst Molecular Biol (ISMB)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541455"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2505735"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541778"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282587"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133132"},{"key":"ref28","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Phys Doklady"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523342"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853300"},{"key":"ref3","first-page":"910","article-title":"Reconstructing strings from random traces","author":"batu","year":"2004","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref6","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","author":"holenstein","year":"2008","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref29","first-page":"288","article-title":"Codes which correct single asymmetric errors","volume":"26","author":"varshamov","year":"1965","journal-title":"Avtomat i Telemeh"},{"key":"ref5","first-page":"399","article-title":"Improved string reconstruction over insertion-deletion channels","author":"viswanathan","year":"2008","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282947"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283016"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541372"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"14138","DOI":"10.1038\/srep14138","article-title":"A rewritable, random-access DNA-based storage system","volume":"5","author":"yazdi","year":"2015","journal-title":"Nature Sci Rep"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872397"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/anie.201411378"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257917"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2413958"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831751"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2544348"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/7879182\/7809143-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7879182\/07809143.pdf?arnumber=7809143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:05Z","timestamp":1649444105000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7809143\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":36,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2649493","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}