{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:34:22Z","timestamp":1774679662109,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849567","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"181-185","source":"Crossref","is-referenced-by-count":12,"title":["Symbolwise MAP for Multiple Deletion Channels"],"prefix":"10.1109","author":[{"given":"Sundara R.","family":"Srinivasavaradhan","sequence":"first","affiliation":[{"name":"University of California, Los Angeles"}]},{"given":"Michelle","family":"Du","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles"}]},{"given":"Suhas","family":"Diggavi","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles"}]},{"given":"Christina","family":"Fragouli","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp324"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw450"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557469"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864445"},{"key":"ref15","article-title":"On transmission over deletion channels","author":"diggavi","year":"2001","journal-title":"Proceedings of the Annual Allerton Conference on Communication Control and Computing"},{"key":"ref16","article-title":"Marker codes for channels with insertions and deletions","author":"ratzer","year":"2005","journal-title":"Annales des Télécommunications"},{"key":"ref17","article-title":"Codes for channels with insertions, deletions and substitutions","author":"ratzer","year":"2000","journal-title":"International Symposium on Turbo Codes and Related Topics"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2650918"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437519"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849567"},{"key":"ref6","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","author":"holenstein","year":"2008","journal-title":"ACM-SIAM SODA ’08"},{"key":"ref5","first-page":"910","article-title":"Reconstructing strings from random traces","author":"batu","year":"2004","journal-title":"SODA ’05"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.29"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055450"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006971"},{"key":"ref9","article-title":"Subpolynomial trace reconstruction for random strings and arbitrary deletion probability","author":"holden","year":"2018","journal-title":"Proceedings of the 31st Conference On Learning Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849567.pdf?arnumber=8849567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:37Z","timestamp":1773347737000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849567\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849567","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}