{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:04:27Z","timestamp":1775837067944,"version":"3.50.1"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education, Singapore","doi-asserted-by":"publisher","award":["MOE2015-T2-2-086"],"award-info":[{"award-number":["MOE2015-T2-2-086"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1109\/tit.2020.2981069","type":"journal-article","created":{"date-parts":[[2020,3,16]],"date-time":"2020-03-16T19:32:25Z","timestamp":1584387145000},"page":"4892-4903","source":"Crossref","is-referenced-by-count":18,"title":["Efficient Encoding\/Decoding of GC-Balanced Codes Correcting Tandem Duplications"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7823-8068","authenticated-orcid":false,"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1705-9597","authenticated-orcid":false,"given":"Johan","family":"Chrisnata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5611-0848","authenticated-orcid":false,"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3179-9471","authenticated-orcid":false,"given":"Tuan Thanh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Codes correcting all patterns of tandem-duplication errors of maximum length 3","author":"kova?evi?","year":"2019","journal-title":"arXiv 1911 06561"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1038\/35057062","article-title":"Initial sequencing and analysis of the human genome","volume":"409","author":"lander","year":"2001","journal-title":"Nature"},{"key":"ref12","article-title":"Bounds and constructions for multi-symbol duplication error correcting codes","author":"lenz","year":"2018","journal-title":"arXiv 1807 02874"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00239-004-2619-6"},{"key":"ref14","author":"nijenhuis","year":"2014","journal-title":"Combinatorial Algorithms for Computers and Calculators"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2013-14-5-r51"},{"key":"ref17","article-title":"An introduction to coding for constrained system","author":"marcus","year":"2001"},{"key":"ref18","author":"sipser","year":"2013","journal-title":"Introduction to the Theory of Computation"},{"key":"ref19","author":"weisstein","year":"2020","journal-title":"Lucas Sequence From MathWorld—A Wolfram Web Resource"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"key":"ref6","article-title":"Properties and constructions of constrained codes for DNA-based data storage","author":"immink","year":"2018","journal-title":"arXiv 1812 06798"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007104"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2868666"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057136"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437789"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3338514"},{"key":"ref9","article-title":"Zero-error capacity of duplication channels","author":"kova?evi?","year":"2019","journal-title":"arXiv 1902 06275"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkj454"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9141502\/09037273.pdf?arnumber=9037273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:22:44Z","timestamp":1651080164000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9037273\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":22,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2981069","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8]]}}}