{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:03:48Z","timestamp":1775837028784,"version":"3.50.1"},"reference-count":45,"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.9517821","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2453-2458","source":"Crossref","is-referenced-by-count":70,"title":["Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage"],"prefix":"10.1109","author":[{"given":"Sundara Rajan","family":"Srinivasavaradhan","sequence":"first","affiliation":[{"name":"University of California,Electrical and Computer Engineering,Los Angeles"}]},{"given":"Sivakanth","family":"Gopi","sequence":"additional","affiliation":[{"name":"Microsoft Research,Redmond,WA"}]},{"given":"Henry D.","family":"Pfister","sequence":"additional","affiliation":[{"name":"Duke University,Electrical and Computer Engineering,Durham,NC"}]},{"given":"Sergey","family":"Yekhanin","sequence":"additional","affiliation":[{"name":"Microsoft Research,Redmond,WA"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878110"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965976"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1101\/2020.09.16.300186","article-title":"Reconstruction algorithms for DNA-storage systems","author":"sabary","year":"2020"},{"key":"ref32","first-page":"29","article-title":"Marker codes for channels with insertions and deletions","volume":"60","author":"ratzer","year":"2005","journal-title":"Annales des Télécommunications"},{"key":"ref31","article-title":"New lower bounds for trace reconstruction","author":"chase","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref30","article-title":"DNA-based storage: Models and fundamental limits","author":"shomorony","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892778"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831854"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813563"},{"key":"ref34","article-title":"Approximate trace reconstruction","author":"davies","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0148063"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365266"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref12","first-page":"910","article-title":"Reconstructing strings from random traces","author":"batu","year":"0","journal-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref13","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","author":"holenstein","year":"0","journal-title":"Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055450"},{"key":"ref15","first-page":"1042","article-title":"Trace reconstruction with exp(o(n1\/3)) samples","author":"nazarov","year":"0","journal-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.4171\/MSL\/16"},{"key":"ref17","article-title":"New upper bounds for trace reconstruction","author":"chase","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref18","article-title":"Trace reconstruction from noisy polynucleotide sequencer reads","author":"gopalan","year":"2018","journal-title":"US Patent application US 2018 \/ 0211001 A1"},{"key":"ref19","article-title":"Trace reconstruction from reads with indeterminant errors","author":"racz","year":"2020","journal-title":"US Patent application US 2020\/0057838 A1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3033513"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"14138","DOI":"10.1038\/srep14138","article-title":"A rewritable, random-access DNA-based storage system","volume":"5","author":"yazdi","year":"2015","journal-title":"Scientific Reports"},{"key":"ref27","first-page":"181","article-title":"Symbol-wise map for multiple deletion channels","author":"srinivasavaradhan","year":"0","journal-title":"2019 IEEE International Symposium on Information Theory (ISIT) IEEE"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007106"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053049"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/anie.201411378"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-19148-3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10978-4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174050"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.910582"},{"key":"ref42","author":"srinivasavaradhan","year":"2021","journal-title":"Trellis BMA Coded trace reconstruction on IDS channels for DNA storage"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2996377"},{"key":"ref41","first-page":"3360","article-title":"Clustering billions of reads for DNA data storage","author":"rashtchian","year":"0","journal-title":"Proceedings of the 30th Annual Conference on Neural Information Processing Systems (NIPS)"},{"key":"ref23","article-title":"Con-catenated codes for recovery from multiple reads of DNA sequences","author":"lenz","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053441"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref25","first-page":"482","article-title":"Coded trace reconstruction in a constant number of traces","author":"brakensiek","year":"0","journal-title":"Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science (FOCS)"}],"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\/09517821.pdf?arnumber=9517821","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:07Z","timestamp":1773347767000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517821\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517821","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}