{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:42Z","timestamp":1773377862777,"version":"3.50.1"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834571","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1797-1802","source":"Crossref","is-referenced-by-count":2,"title":["Correcting multiple short duplication and substitution errors"],"prefix":"10.1109","author":[{"given":"Yuanyuan","family":"Tang","sequence":"first","affiliation":[{"name":"Electrical & Computer Engineering, University of Virginia,U.S.A."}]},{"given":"Shuche","family":"Wangy","sequence":"additional","affiliation":[{"name":"Institute of Operations Research and Analytics, National University of Singapore"}]},{"given":"Ryan","family":"Gabrysz","sequence":"additional","affiliation":[{"name":"Calit2, University of California-San Diego,U.S.A."}]},{"given":"Farzad","family":"Farnoud","sequence":"additional","affiliation":[{"name":"Electrical & Computer Engineering, University of Virginia,U.S.A."}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174009"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518049"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919847"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3125724"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174241"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2868666"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940256"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3006228"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2961265"},{"key":"ref14","article-title":"Optimal codes correcting a single indel\/edit for DNA-based data storage","author":"cai","year":"2019","journal-title":"arXiv preprint arXiv 1910 06501"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2942283"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174272"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174404"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174253"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174139"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3338514"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1126\/science.aaj2038","article-title":"DNA fountain enables a robust and efficient storage architecture","volume":"355","author":"erlich","year":"2017","journal-title":"Science"},{"key":"ref27","article-title":"Codes correcting all patterns of tandem-duplication errors of maximum length 3","author":"kova?evi?","year":"2019","journal-title":"arXiv preprint arXiv 1911 11698"},{"key":"ref3","first-page":"1","article-title":"A rewritable, random-access DNA-based storage system","volume":"5","author":"yazdi","year":"2015","journal-title":"Scientific Reports"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174444"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.398"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10258-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007104"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/nature23017"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174322"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174447"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174438"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611403"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2981069"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2728079"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3059095"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834571.pdf?arnumber=9834571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:23Z","timestamp":1773347723000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834571\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834571","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}