{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:19Z","timestamp":1773377599419,"version":"3.50.1"},"reference-count":16,"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\/100012579","name":"ISF","doi-asserted-by":"publisher","award":["222\/19"],"award-info":[{"award-number":["222\/19"]}],"id":[{"id":"10.13039\/100012579","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"United States-Israel BSF","doi-asserted-by":"publisher","award":["2018048"],"award-info":[{"award-number":["2018048"]}],"id":[{"id":"10.13039\/501100001742","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.9517922","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1979-1984","source":"Crossref","is-referenced-by-count":6,"title":["On Levenshtein Balls with Radius One"],"prefix":"10.1109","author":[{"given":"Daniella","family":"Bar-Lev","sequence":"first","affiliation":[{"name":"Technion-Israel Institute of Technology,Dept. of Computer Science,Haifa,Israel,3200003"}]},{"given":"Tuvi","family":"Etzion","sequence":"additional","affiliation":[{"name":"Technion-Israel Institute of Technology,Dept. of Computer Science,Haifa,Israel,3200003"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion-Israel Institute of Technology,Dept. of Computer Science,Haifa,Israel,3200003"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1093\/bioinformatics\/btaa740","article-title":"SOLQC: Synthetic oligo library quality control Tool","author":"sabary","year":"2021","journal-title":"Bioinformatics btaa740"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620761"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970810"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849750"},{"key":"ref14","article-title":"DNA punch cards: Encoding data on native DNA sequences via topological modifications","author":"tabatabaei","year":"2019","journal-title":"BioRxiv"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849705"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"5011","DOI":"10.1038\/s41598-017-05188-1","article-title":"Portable and errorfree DNA-based data storage","volume":"7","author":"yazdi","year":"2017","journal-title":"Scientific Reports"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1038\/nature11875","article-title":"Towards practical, high-capacity, low-maintenance information storage in synthesized DNA","volume":"494","author":"goldman","year":"2013","journal-title":"Nature"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620316"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"9663","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":"Scientific Reports"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref7","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"ref2","first-page":"84","article-title":"Explicit and efficient constructions of coding schemes for the binary deletion channel and the poisson repeat channel","author":"con","year":"0","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref9","article-title":"Scaling up DNA data storage and random access retrieval","author":"organick","year":"2017","journal-title":"BioRxiv"}],"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\/09517922.pdf?arnumber=9517922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:32Z","timestamp":1773347672000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517922\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517922","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}