{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:24:52Z","timestamp":1774023892371,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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","doi-asserted-by":"publisher","award":["MOE2019-T2-2-123,MOE2019-T2-2-171"],"award-info":[{"award-number":["MOE2019-T2-2-123,MOE2019-T2-2-171"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517851","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1694-1699","source":"Crossref","is-referenced-by-count":19,"title":["Coding for Segmented Edits with Local Weight Constraints"],"prefix":"10.1109","author":[{"given":"Kui","family":"Cai","sequence":"first","affiliation":[{"name":"Singapore University of Technology and Design,Singapore,487372"}]},{"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[{"name":"Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore,637371"}]},{"given":"Mehul","family":"Motani","sequence":"additional","affiliation":[{"name":"National University of Singapore,Department of Electrical & Computer Engineering,Singapore,119077"}]},{"given":"Tuan Thanh","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design,Singapore,487372"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2559504"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006775"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174430"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849643"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174438"},{"key":"ref15","article-title":"Correcting a Single Indel \/ Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality","author":"cai","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849750"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174241"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"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":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2930970"},{"key":"ref27","article-title":"DNA Codes with Run-Length Limitation and Knuth-Like Balancing of the GC Contents","author":"dube","year":"2019","journal-title":"Symp Information Theory and its Applications (SITA 92)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2317480"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.031213.120723"},{"key":"ref2","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":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2993467"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-019-45832-6","article-title":"A Characterization of the DNA Data Storage Channel","author":"heckel","year":"2019","journal-title":"Scientific Reports"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2788143"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034886"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.1270"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.2181"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS.2018.8598361"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517851.pdf?arnumber=9517851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:17Z","timestamp":1773347777000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517851\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517851","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}