{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:54:01Z","timestamp":1776956041199,"version":"3.51.4"},"reference-count":29,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518269","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2666-2671","source":"Crossref","is-referenced-by-count":8,"title":["Correcting Two Deletions with More Reads"],"prefix":"10.1109","author":[{"given":"Johan","family":"Chrisnata","sequence":"first","affiliation":[{"name":"Technion — Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]},{"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[{"name":"School of Physical and Mathematical Sciences, Nanyang Technological University,Singapore,637371"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref14","article-title":"Optimal Reconstruction Codes for Deletion Channels","author":"chrisnata","year":"2020"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1126\/science.1145799"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2016.2529240"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2807480"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174139"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2950290"},{"key":"ref27","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)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00028"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2950290"},{"key":"ref1","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":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2996377"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.08.003"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800044"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649493"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.11.005"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849740"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940256"}],"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\/09518269.pdf?arnumber=9518269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:45Z","timestamp":1773347685000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518269\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518269","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}