{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T16:16:05Z","timestamp":1771949765911,"version":"3.50.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1705077"],"award-info":[{"award-number":["1705077"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1740047"],"award-info":[{"award-number":["1740047"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University of California-National Labs","award":["LFR-18- 548554"],"award-info":[{"award-number":["LFR-18- 548554"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/tit.2020.3033513","type":"journal-article","created":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T20:54:24Z","timestamp":1603745664000},"page":"3389-3410","source":"Crossref","is-referenced-by-count":9,"title":["Algorithms for Reconstruction Over Single and Multiple Deletion Channels"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2813-3166","authenticated-orcid":false,"given":"Sundara Rajan","family":"Srinivasavaradhan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4963-8393","authenticated-orcid":false,"given":"Michelle","family":"Du","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7313-9861","authenticated-orcid":false,"given":"Suhas N.","family":"Diggavi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1002-5829","authenticated-orcid":false,"given":"Christina","family":"Fragouli","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-642-56656-1_13","article-title":"Solving the shortest common supersequence problem","author":"nicosia","year":"2001","journal-title":"Operations Research Proceedings"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970811"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.08.035"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316303"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592073"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/140988978"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.10.016"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055494"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/19-AAP1506"},{"key":"ref12","article-title":"New lower bounds for trace reconstruction","author":"chase","year":"2019","journal-title":"arXiv 1905 03031"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006971"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557469"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp324"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref27","article-title":"Coded trace reconstruction in a constant number of traces","author":"brakensiek","year":"2019","journal-title":"arXiv 1908 03996"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174130"},{"key":"ref6","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","author":"holenstein","year":"2008","journal-title":"Proc ACM-SIAM SODA"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw450"},{"key":"ref5","first-page":"910","article-title":"Reconstructing strings from random traces","author":"batu","year":"2004","journal-title":"Proc SODA"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055450"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849567"},{"key":"ref9","first-page":"1799","article-title":"Subpolynomial trace reconstruction for random strings and arbitrary deletion probability","author":"holden","year":"2018","journal-title":"Proc 31st Conf Learn Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437519"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864445"},{"key":"ref22","article-title":"Marker codes for channels with insertions and deletions","author":"ratzer","year":"2005","journal-title":"Annales des Télécommunications"},{"key":"ref21","first-page":"1","article-title":"On transmission over deletion channels","author":"diggavi","year":"2001","journal-title":"Proc Annu Allerton Conf Commun Control Comput"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2650918"},{"key":"ref23","first-page":"149","article-title":"Codes for channels with insertions, deletions and substitutions","author":"ratzer","year":"2000","journal-title":"Proc 2nd Int Symp Turbo Codes & Related Topics"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2996377"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849647"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9437276\/9239329-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9437276\/09239329.pdf?arnumber=9239329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:18Z","timestamp":1652194458000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9239329\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":37,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3033513","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}