{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:54:06Z","timestamp":1776956046648,"version":"3.51.4"},"reference-count":26,"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.9517842","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1706-1711","source":"Crossref","is-referenced-by-count":12,"title":["On List Decoding of Insertions and Deletions under the Reconstruction Model"],"prefix":"10.1109","author":[{"given":"Maria","family":"Abu-Sini","sequence":"first","affiliation":[{"name":"Technion - Israel Institute of Technology,Haifa,Israel,3200009"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology,Haifa,Israel,3200009"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057841"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849427"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437894"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1","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":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48452-3_9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849616"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2918"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2875386"},{"key":"ref3","first-page":"910","article-title":"Reconstructing strings from random traces","author":"batu","year":"0","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref6","first-page":"22","article-title":"There's plenty of room at the bottom","volume":"23","author":"feynman","year":"1960","journal-title":"Engineering and Applied Science California Institute of Technology"},{"key":"ref5","article-title":"List decoding for noisy channels","author":"elias","year":"1957","journal-title":"Research Laboratory of Electronics MIT"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref7","first-page":"524","article-title":"Optimally resilient codes for list-decoding from insertions and deletions","author":"guruswami","year":"0","journal-title":"In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"},{"key":"ref2","first-page":"41","article-title":"New upper bounds for error correcting codes","volume":"1","author":"bassalygo","year":"1965","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref9","first-page":"76:1","article-title":"Synchronization strings: List decoding for insertions and deletions","author":"haeupler","year":"2018","journal-title":"International Colloquium on Automata Languages and Programming (ICALP)"},{"key":"ref1","article-title":"On Levenshtein's reconstruction problem under insertions, deletions, and substitutions","author":"abu-sini","year":"0","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref20","author":"liu","year":"2019","journal-title":"On list decoding of insertion and deletion errors"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649493"},{"key":"ref21","article-title":"SOLQC: Synthetic oligo library quality control tool","author":"sabary","year":"2019","journal-title":"BioRxiv"},{"key":"ref24","first-page":"90","article-title":"List Decoding","volume":"48","author":"wozencraft","year":"1958","journal-title":"Quarterly Progress Report"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777471"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174322"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2878750"}],"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\/09517842.pdf?arnumber=9517842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:23Z","timestamp":1773347663000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517842\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517842","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}