{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:46Z","timestamp":1773377866262,"version":"3.50.1"},"reference-count":25,"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"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1816409,1755773"],"award-info":[{"award-number":["1816409,1755773"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518049","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1835-1840","source":"Crossref","is-referenced-by-count":7,"title":["Error-correcting codes for short tandem duplications and at most $p$ substitutions"],"prefix":"10.1109","author":[{"given":"Yuanyuan","family":"Tang","sequence":"first","affiliation":[{"name":"University of Virginia,Electrical & Computer Engineering,U.S.A."}]},{"given":"Hao","family":"Lou","sequence":"additional","affiliation":[{"name":"University of Virginia,Electrical & Computer Engineering,U.S.A."}]},{"given":"Farzad","family":"Farnoud","sequence":"additional","affiliation":[{"name":"University of Virginia,Electrical & Computer Engineering,U.S.A."}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2961265"},{"key":"ref11","article-title":"Optimal codes correcting a single indel\/edit for DNA-based data storage","author":"cai","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2942283"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174272"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174404"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174253"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174139"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174322"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174438"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174447"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/nature23017"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2728079"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940256"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2868666"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10258-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3006228"},{"key":"ref1","author":"reinsel","year":"2020","journal-title":"Worldwide global datasphere forecast 2020–2024 The covid-19 data bump and the future of data growth"},{"key":"ref20","article-title":"Codes correcting all patterns of tandem-duplication errors of maximum length 3","author":"kova?evi?","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174444"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3338514"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919847"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2981069"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174444"}],"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\/09518049.pdf?arnumber=9518049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:24Z","timestamp":1773347724000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518049\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518049","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}