{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:34:21Z","timestamp":1774679661361,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174139","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"676-681","source":"Crossref","is-referenced-by-count":11,"title":["Coding for Sequence Reconstruction for Single Edits"],"prefix":"10.1109","author":[{"given":"Han Mao","family":"Kiah","sequence":"first","affiliation":[{"name":"Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore,637371"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuan","family":"Thanh Nguyen","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design,Singapore,487372"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Israel Institute of Technology,Department of Computer Science, Technion,Haifa,Israel,32000"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800044"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.08.003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.11.005"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649493"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437731"},{"key":"ref16","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":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref18","volume":"16","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257917"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1126\/science.1145799","article-title":"Magnetic domain-wall racetrack memory","volume":"320","author":"parkin","year":"2008","journal-title":"Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989261"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2807480"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2016.2529240"},{"key":"ref2","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":"ref1","doi-asserted-by":"crossref","first-page":"1628","DOI":"10.1126\/science.1226355","article-title":"Next-generation digital information storage in DNA","volume":"337","author":"church","year":"2012","journal-title":"Science"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174139"},{"key":"ref20","article-title":"Reconstruction of Sequences in DNA Storage","author":"abu sini","year":"2019","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref22","article-title":"Coding for Sequence Reconstruction for Single Edits","author":"chrisnata","year":"2020","journal-title":"arXiv preprint arXiv 2004 06774"},{"key":"ref21","article-title":"The Levenshtein’s channel and the list size in information retrieval","author":"junnnila","year":"2019","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174139.pdf?arnumber=9174139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:51Z","timestamp":1773347691000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174139\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174139","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}