{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T18:40:43Z","timestamp":1784227243953,"version":"3.55.0"},"reference-count":123,"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":[{"name":"NIH","award":["2-P41-GM103484PP"],"award-info":[{"award-number":["2-P41-GM103484PP"]}]},{"DOI":"10.13039\/100002570","name":"American Association of Immunologists","doi-asserted-by":"publisher","award":["AAI Intersect Fellowship 2019"],"award-info":[{"award-number":["AAI Intersect Fellowship 2019"]}],"id":[{"id":"10.13039\/100002570","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF EAGER award 2032783"],"award-info":[{"award-number":["NSF EAGER award 2032783"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/tit.2020.3030569","type":"journal-article","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T19:59:01Z","timestamp":1602619141000},"page":"3295-3314","source":"Crossref","is-referenced-by-count":28,"title":["Trace Reconstruction Problems in Computational Biology"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6913-2533","authenticated-orcid":false,"given":"Vinnu","family":"Bhardwaj","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pavel A.","family":"Pevzner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9422-2779","authenticated-orcid":false,"given":"Cyrus","family":"Rashtchian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9634-4216","authenticated-orcid":false,"given":"Yana","family":"Safonova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.26508\/lsa.201800221"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1098\/rstb.2014.0236"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-017-05188-1","article-title":"Portable and error-free DNA-based data storage","volume":"7","author":"yazdi","year":"2017","journal-title":"Sci Rep"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1038\/nature23017","article-title":"CRISPR–Cas encoding of a digital movie into the genomes of a population of living bacteria","volume":"547","author":"shipman","year":"2017","journal-title":"Nature"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref37","first-page":"1","article-title":"IGHV1-69 polymorphism modulates anti-influenza antibody repertoires, correlates with IGHV utilization shifts and varies by ethnicity","volume":"6","author":"avnir","year":"2016","journal-title":"Sci Rep"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.chom.2013.05.008"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1038\/gene.2012.12"},{"key":"ref34","author":"delves","year":"2017","journal-title":"Essential Immunology"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaj2038"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1038\/s41596-019-0244-5","article-title":"Reading and writing digital data in DNA","volume":"15","author":"meiser","year":"2020","journal-title":"Nature Protocols"},{"key":"ref20","first-page":"399","article-title":"Improved string reconstruction over insertion-deletion channels","author":"viswanathan","year":"2008","journal-title":"Proc 19th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3389\/fimmu.2019.00987"},{"key":"ref21","author":"compeau","year":"2018","journal-title":"Bioinformatics algorithms an active learning approach"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1038\/s41576-019-0125-3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1007837"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872397"},{"key":"ref101","author":"alon","year":"2004","journal-title":"The Probabilistic Method"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref100","first-page":"10531","article-title":"Sample complexity of learning mixture of sparse linear regressions","author":"krishnamurthy","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-09517-y"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304027"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849523"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2775608"},{"key":"ref57","first-page":"711","article-title":"Coding for optimized writing rate in DNA storage","author":"jain","year":"2020","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174404"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849814"},{"key":"ref54","first-page":"1","article-title":"DNA codes with run-length limitation and Knuth-like balancing of the GC contents","author":"dub\u00e9","year":"2019","journal-title":"Proc Symp Inf Theory Appl (SITA)"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-15588-z"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0240-x"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.4049\/jimmunol.1601710"},{"key":"ref4","first-page":"910","article-title":"Reconstructing strings from random traces","author":"batu","year":"2004","journal-title":"Proc 15th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref6","article-title":"Coded trace reconstruction in a constant number of traces","author":"brakensiek","year":"2019","journal-title":"arXiv 1908 03996"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849647"},{"key":"ref8","article-title":"New lower bounds for trace reconstruction","author":"chase","year":"2019","journal-title":"arXiv 1905 03031"},{"key":"ref49","first-page":"91","article-title":"Bounds and estimates on the average edit distance","author":"schimd","year":"2019","journal-title":"Proc Int Symp String Process Inf Retr"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/18-AAP1394"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2996377"},{"key":"ref46","first-page":"3360","article-title":"Clustering billions of reads for DNA data storage","author":"rashtchian","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10978-4"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541302"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0169774"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.4049\/jimmunol.1700306"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919890"},{"key":"ref43","article-title":"SOLQC: Synthetic oligo library quality control tool","volume":"1","author":"sabary","year":"2019","journal-title":"BioRxiv"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1534\/genetics.116.196303"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1159\/000334381"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1093\/sysbio\/syq010"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-14319-8"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/s00239-010-9405-4"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1093\/molbev\/msm079"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1212755109"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1005086"},{"key":"ref78","first-page":"8","article-title":"Binary codes capable of correcting spurious insertions and deletions of ones","volume":"1","author":"levenshtein","year":"1965","journal-title":"Problems Inf Trans"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1994.1.337"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174272"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174295"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437544"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989388"},{"key":"ref64","article-title":"Coding for polymer-based data storage","author":"pattabiraman","year":"2020","journal-title":"arXiv 2003 02121"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849596"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849737"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS.2018.8598361"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007106"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref1","first-page":"417","article-title":"Reconstruction of objects from a minimum number of distorted patterns","volume":"55","author":"levenshtein","year":"1997","journal-title":"Doklady Mathematics"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970811"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849567"},{"key":"ref108","article-title":"Optimal reconstruction codes for deletion channels","author":"chrisnata","year":"2020","journal-title":"arXiv 2004 06032"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3033513"},{"key":"ref107","article-title":"Polynomial-time trace reconstruction in the smoothed complexity model","author":"chen","year":"2020","journal-title":"arXiv 2008 12386"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174488"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.29"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1998.2870"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"ref104","article-title":"Shotgun reconstruction in the hypercube","author":"przykucki","year":"2019","journal-title":"arXiv 1907 07250"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140102"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00050"},{"key":"ref112","first-page":"44:1","article-title":"Efficient average-case population recovery in the presence of insertions and deletions","volume":"145","author":"ban","year":"2019","journal-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174139"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1112\/S0024611599011831"},{"key":"ref99","first-page":"468","article-title":"Algebraic and analytic approaches for parameter learning in mixture models","volume":"117","author":"krishnamurthy","year":"2020","journal-title":"Proc 31st Int Conf Algorithmic Learn Theory"},{"key":"ref96","article-title":"New upper bounds for trace reconstruction","author":"chase","year":"2020","journal-title":"arXiv 2009 03296"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1997.46.1435"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975062.6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/19-AAP1506"},{"key":"ref12","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","author":"holenstein","year":"2008","journal-title":"Proc 19th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref13","first-page":"1799","article-title":"Subpolynomial trace reconstruction for random strings and arbitrary deletion probability","author":"holden","year":"2018","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref14","first-page":"68:1","article-title":"Trace reconstruction: Generalized and parameterized","volume":"144","author":"krishnamurthy","year":"2019","journal-title":"Proc 27th Annu Eur Symp Algorithms (ESA)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2630056"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809001"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.3389\/fimmu.2018.02149"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1039\/C9NR04566J"},{"key":"ref17","first-page":"689","article-title":"Trace reconstruction revisited","author":"mcgregor","year":"2014","journal-title":"Proc Eur Symp Algorithms (ESA)"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0018093"},{"key":"ref117","article-title":"Circular trace reconstruction","author":"narayanan","year":"2020","journal-title":"arXiv 2009 01346"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055494"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.4049\/jimmunol.1000445"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437519"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1080\/19420862.2019.1584517"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1021\/acssensors.8b00165"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.20"},{"key":"ref113","article-title":"Population recovery from the deletion channel: Nearly matching trace reconstruction bounds","author":"narayanan","year":"2020","journal-title":"arXiv 2004 06828"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.0030123"},{"key":"ref116","first-page":"961","article-title":"Reconstructing trees from traces","author":"davies","year":"2019","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.14"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bby003"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1021\/acs.nanolett.8b04715"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-biochem-060308-102244"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1017\/S0033583500003590"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-5-113"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1417683112"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms13642"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.3389\/fimmu.2016.00457"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1004409"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9437276\/9222300-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9437276\/09222300.pdf?arnumber=9222300","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\/9222300\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":123,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3030569","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}