{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T15:41:26Z","timestamp":1781797286860,"version":"3.54.5"},"reference-count":34,"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":"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\/501100001459","name":"Singapore Ministry of Education Academic Research Fund Tier 2","doi-asserted-by":"publisher","award":["MOE2016-T2-2-054"],"award-info":[{"award-number":["MOE2016-T2-2-054"]}],"id":[{"id":"10.13039\/501100001459","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.3049627","type":"journal-article","created":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T16:06:57Z","timestamp":1610035617000},"page":"3438-3451","source":"Crossref","is-referenced-by-count":67,"title":["Correcting a Single Indel\/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2059-0071","authenticated-orcid":false,"given":"Kui","family":"Cai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7823-8068","authenticated-orcid":false,"given":"Yeow Meng","family":"Chee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9197-3371","authenticated-orcid":false,"given":"Ryan","family":"Gabrys","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5611-0848","authenticated-orcid":false,"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3179-9471","authenticated-orcid":false,"given":"Tuan Thanh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-017-05188-1","article-title":"Portable and error-free DNA-based data storage","volume":"7","author":"yazdi","year":"2017","journal-title":"Sci Rep"},{"key":"ref31","first-page":"288","article-title":"Codes which correct single asymmetric errors","volume":"26","author":"varshamov","year":"1965","journal-title":"Avtomat Telemekhan"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100209"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkj454"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2778143"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174139"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-45832-6","article-title":"A characterization of the DNA data storage channel","volume":"9","author":"heckel","year":"2019","journal-title":"Sci Rep"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2980036"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100207"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257917"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057136"},{"key":"ref19","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"163","author":"levenshtein","year":"1965","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2788143"},{"key":"ref27","author":"tan","year":"2020","journal-title":"Single Edit Correcting Code"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437715"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053256"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040868"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849643"},{"key":"ref8","first-page":"187","article-title":"Genetic mutation","volume":"1","author":"clancy","year":"2008","journal-title":"Nature Edu"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2996377"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849647"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849483"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.651063"},{"key":"ref20","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 Kibernetiki"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034886"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/DFTVS.1999.802895"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2013-14-5-r51"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174241"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9437276\/09316155.pdf?arnumber=9316155","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\/9316155\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":34,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3049627","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}