{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:06:36Z","timestamp":1755219996528,"version":"3.43.0"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437789","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"2406-2410","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Encoding\/Decoding of Irreducible Words for Codes Correcting Tandem Duplications"],"prefix":"10.1109","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[{"name":"Nanyang Technological University, School of Physical and Mathematical Sciences, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Chrisnata","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, School of Physical and Mathematical Sciences, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, School of Physical and Mathematical Sciences, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuan Thanh","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, School of Physical and Mathematical Sciences, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00239-004-2619-6"},{"key":"ref3","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"},{"journal-title":"Deciding the confusability of words under tandem repeats","year":"2017","author":"chee","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"},{"journal-title":"An introduction to coding for constrained systems","year":"2001","author":"marcus","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007104"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"journal-title":"Combinatorial Algorithms for Computers and Calculators","year":"2014","author":"nijenhuis","key":"ref9"},{"key":"ref1","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":"Scientific Reports"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437789.pdf?arnumber=8437789","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:42:23Z","timestamp":1754588543000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437789\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437789","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}