{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:52Z","timestamp":1773377932405,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001475","name":"Nanyang Technological University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001475","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834433","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"992-997","source":"Crossref","is-referenced-by-count":14,"title":["Sequence Reconstruction Problem for Deletion Channels: A Complete Asymptotic Solution"],"prefix":"10.1109","author":[{"given":"Van Long","family":"Phuoc Pham","sequence":"first","affiliation":[{"name":"Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore"}]},{"given":"Keshav","family":"Goyal","sequence":"additional","affiliation":[{"name":"Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore"}]},{"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[{"name":"Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800044"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649493"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3110710"},{"key":"ref13","article-title":"Coding for Sequence Reconstruction for Single Edits","author":"cai","year":"2021","journal-title":"IEEE Trans Inf Theory"},{"key":"ref14","first-page":"279","article-title":"Optimal Reconstruction Codes for Deletion Channels","author":"chrisnata","year":"2020","journal-title":"Proc IEEE Int Symp Inf Theory and Its Applications (ISITA)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518269"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.08.035"},{"key":"ref17","author":"pham","year":"2021","journal-title":"Sequence Reconstruction Problem for Deletion Channels A Complete Asymptotic Solution"},{"key":"ref18","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":"ref19","article-title":"On the Computation of Levenshtein&#x2019;s Distances","author":"calabi","year":"1967"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref3","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":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2961265"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2807480"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1126\/science.1145799"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834433.pdf?arnumber=9834433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:36Z","timestamp":1773347736000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834433\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834433","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}