{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:06:00Z","timestamp":1750824360223,"version":"3.41.0"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"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":["CIF-2312871","CIF-2312873","CIF-2144974"],"award-info":[{"award-number":["CIF-2312871","CIF-2312873","CIF-2144974"]}],"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":[[2025,7]]},"DOI":"10.1109\/tit.2025.3562730","type":"journal-article","created":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T17:37:11Z","timestamp":1745257031000},"page":"5178-5191","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Codes Correcting a Substring Edit"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-7513-9820","authenticated-orcid":false,"given":"Yuting","family":"Li","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2946-7782","authenticated-orcid":false,"given":"Yuanyuan","family":"Tang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6133-2987","authenticated-orcid":false,"given":"Hao","family":"Lou","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9197-3371","authenticated-orcid":false,"given":"Ryan","family":"Gabrys","sequence":"additional","affiliation":[{"name":"Calit2, University of California at San Diego, San Diego, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8684-4487","authenticated-orcid":false,"given":"Farzad Hassanzadeh","family":"Farnoud","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering and the Department of Computer Science, University of Virginia, Charlottesville, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1","article-title":"A rewritable, random-access DNA-based storage system","volume-title":"Sci. Rep.","volume":"5","author":"Tabatabaei Yazdi","year":"2015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185373"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206790"},{"article-title":"Codes for correcting insertion and deletion errors","year":"1994","author":"Bours","key":"ref4"},{"key":"ref5","first-page":"293","article-title":"Asymptotically optimum binary code with correction for losses of one or two adjacent bits","volume":"19","author":"Levenshtein","year":"1967","journal-title":"Problemy Kibernet"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174288"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518196"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3202856"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800467"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875032"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2025.3531915"},{"key":"ref13","first-page":"197","article-title":"Communication complexity of document exchange","volume-title":"Proc. 11th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Cormode"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498448"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_56"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897577"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.15"},{"key":"ref19","article-title":"Efficient deterministic single round document exchange for edit distance","author":"Belazzougui","year":"2015","journal-title":"arXiv:1511.09229"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00028"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00029"},{"key":"ref22","first-page":"37:1","article-title":"Block Edit errors with transpositions: Deterministic document exchange protocols and almost optimal binary codes","volume-title":"Proc. 46th Int. Colloq. Automata, Lang., Program. (ICALP)","volume":"132","author":"Cheng"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3340246"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/11045245\/10971390-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11045245\/10971390.pdf?arnumber=10971390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T06:10:53Z","timestamp":1750745453000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10971390\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":24,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3562730","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,7]]}}}