{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:12:18Z","timestamp":1771611138754,"version":"3.50.1"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1527110"],"award-info":[{"award-number":["CCF-1527110"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1618280"],"award-info":[{"award-number":["CCF-1618280"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1814603"],"award-info":[{"award-number":["CCF-1814603"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1910588"],"award-info":[{"award-number":["CCF-1910588"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF CAREER","doi-asserted-by":"publisher","award":["CCF-1750808"],"award-info":[{"award-number":["CCF-1750808"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Sloan Research Fellowship"},{"DOI":"10.13039\/501100000781","name":"European Research Council (ERC) through the European Union\u2019s Horizon 2020 Research and Innovation Program under ERC","doi-asserted-by":"publisher","award":["949272"],"award-info":[{"award-number":["949272"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/tit.2021.3056317","type":"journal-article","created":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T07:19:46Z","timestamp":1612336786000},"page":"3190-3206","source":"Crossref","is-referenced-by-count":34,"title":["Synchronization Strings and Codes for Insertions and Deletions\u2014A Survey"],"prefix":"10.1109","volume":"67","author":[{"given":"Bernhard","family":"Haeupler","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4013-9096","authenticated-orcid":false,"given":"Amirbehshad","family":"Shahrasbi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055498"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053772"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.556130"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.613346"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057684"},{"key":"ref30","first-page":"524","article-title":"Optimally resilient codes for list-decoding from insertions and deletions","author":"guruswami","year":"2020","journal-title":"Proc Symp Theory of Computing (STOC)"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/18.556604"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1995.550452"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/0135034"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057587"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.15"},{"key":"ref62","first-page":"482","article-title":"Coded trace reconstruction in a constant number of traces","author":"brakensiek","year":"2020","journal-title":"Proc IEEE 61st Annu Symp Found Comput Sci (FOCS)"},{"key":"ref61","first-page":"1","article-title":"Efficient linear and affine codes for correcting insertions\/deletions","author":"cheng","year":"2020","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173977"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2621044"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2981321"},{"key":"ref29","article-title":"On list decoding of insertion and deletion errors","author":"liu","year":"2019","journal-title":"arXiv 1906 09705"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1963.1088781"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00028"},{"key":"ref21","first-page":"75:1","article-title":"Synchronization strings: Channel simulations and interactive coding for insertions and deletions","author":"haeupler","year":"2018","journal-title":"Proc Int Conf Automata Lang Program (ICALP)"},{"key":"ref24","first-page":"76","article-title":"Synchronization strings: List decoding for insertions and deletions","author":"haeupler","year":"2018","journal-title":"Proc Int Conf Automata Lang Program (ICALP)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00029"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777471"},{"key":"ref25","article-title":"Rate-distance tradeoffs for list-decodable insertion-deletion codes","author":"haeupler","year":"2020","journal-title":"arXiv 2009 13307"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2734881"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/100799642"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897577"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_56"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498448"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185373"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.32"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.49"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/359581.359603"},{"key":"ref10","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Sov Phys Doklady"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188940"},{"key":"ref12","first-page":"273","article-title":"On single-deletion-correcting codes","volume":"10","author":"sloane","year":"2002","journal-title":"CODES02"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.971760"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2174961"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.796406"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541373"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.398"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.132"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2954680.2872397"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/140975000"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3023962"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188816"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316371"},{"key":"ref41","author":"rubinstein","year":"2018","journal-title":"Approximating Edit Distance"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/17M116149X"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855587"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9437276\/9344633-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9437276\/09344633.pdf?arnumber=9344633","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:18Z","timestamp":1652194458000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9344633\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":63,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3056317","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}