{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T21:25:20Z","timestamp":1770067520187,"version":"3.49.0"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF Grants","doi-asserted-by":"publisher","award":["1816409"],"award-info":[{"award-number":["1816409"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF Grants","doi-asserted-by":"publisher","award":["1755773"],"award-info":[{"award-number":["1755773"]}],"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":[[2022,2]]},"DOI":"10.1109\/tit.2021.3125724","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T23:17:41Z","timestamp":1636413461000},"page":"871-880","source":"Crossref","is-referenced-by-count":10,"title":["Error-Correcting Codes for Short Tandem Duplication and Edit Errors"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2946-7782","authenticated-orcid":false,"given":"Yuanyuan","family":"Tang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8684-4487","authenticated-orcid":false,"given":"Farzad","family":"Farnoud","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174444"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2868666"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940256"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3006228"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2961265"},{"key":"ref8","article-title":"Optimal codes correcting a single indel\/edit for DNA-based data storage","author":"Cai","year":"2019","journal-title":"arXiv:1910.06501"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2942283"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174272"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174404"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174253"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174139"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174322"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174438"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174447"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2728079"},{"key":"ref18","article-title":"Codes correcting all patterns of tandem-duplication errors of maximum length 3","author":"Kova\u010devi\u0107","year":"2019","journal-title":"arXiv:1911.06561"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3338514"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3059095"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00438-007-0294-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-019-2603-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626302"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24635-0_22"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2981069"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9687099\/9605683-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9687099\/09605683.pdf?arnumber=9605683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:54:49Z","timestamp":1705017289000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9605683\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":25,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3125724","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2]]}}}