{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:04:28Z","timestamp":1775837068614,"version":"3.50.1"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100004358","name":"Samsung Research Funding & Incubation Center for Future Technology","doi-asserted-by":"publisher","award":["SRFC-IT1802-09"],"award-info":[{"award-number":["SRFC-IT1802-09"]}],"id":[{"id":"10.13039\/100004358","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3116245","type":"journal-article","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T21:37:51Z","timestamp":1632951471000},"page":"135354-135363","source":"Crossref","is-referenced-by-count":7,"title":["Design of Nonbinary Error Correction Codes With a Maximum Run-Length Constraint to Correct a Single Insertion or Deletion Error for DNA Storage"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1056-2421","authenticated-orcid":false,"given":"Xiaozhou","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-5915","authenticated-orcid":false,"given":"Sunghwan","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.020513.122820"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2775608"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3012688"},{"key":"ref13","first-page":"288","article-title":"Codes correcting single asymmetric errors","volume":"26","author":"varshamov","year":"1965","journal-title":"Autom Telemekhan"},{"key":"ref14","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":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437715"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3066430"},{"key":"ref18","first-page":"294","article-title":"Encoding algorithm for run-length limited single insertion\/deletion correcting code","author":"takemoto","year":"2020","journal-title":"Proc Int Symp Inf Theory App (ISITA)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/anie.201411378"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.398"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"14138","DOI":"10.1038\/srep14138","article-title":"A rewritable, random-access DNA-based storage system","volume":"5","author":"yazdi","year":"2015","journal-title":"Sci Rep"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10978-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaj2038"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919890"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2924827"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541374"},{"key":"ref21","first-page":"284","article-title":"Decoding algorithms of monotone codes and azinv codes and their unified view","author":"takahashi","year":"2020","journal-title":"Proc Int Symp Inf Theory Appl (ISITA)"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09552003.pdf?arnumber=9552003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:55:47Z","timestamp":1639770947000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9552003\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3116245","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}