{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T19:25:12Z","timestamp":1770060312796,"version":"3.49.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2995812","type":"journal-article","created":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T20:32:01Z","timestamp":1590006721000},"page":"96150-96161","source":"Crossref","is-referenced-by-count":5,"title":["Construction of Duplication Correcting Codes"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5461-1232","authenticated-orcid":false,"given":"Mohamadbagher","family":"Zeraatpisheh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8894-7017","authenticated-orcid":false,"given":"Morteza","family":"Esmaeili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9919-0323","authenticated-orcid":false,"given":"T. Aaron","family":"Gulliver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057136"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.10.003"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849307"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0523-0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2792488"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/nature23017"},{"key":"ref13","article-title":"Efficient encoding\/decoding of irreducible words for codes correcting tandem duplications","author":"meng chee","year":"2018","journal-title":"arXiv 1801 02310"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1021\/bp049917i"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-8-176"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0042465"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/602421.602426"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1038\/21092"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2734881"},{"key":"ref28","article-title":"Bounds and constructions for multi-symbol duplication error correcting codes","author":"lenz","year":"2018","journal-title":"arXiv 1807 02874"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/8072463"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2868666"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/anie.201411378"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0356-z"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2018.6053"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/s41576-019-0125-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1186\/s13036-019-0211-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/srep14138"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2912572"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2778143"},{"key":"ref21","article-title":"Optimal codes correcting a single indel\/edit for DNA-based data storage","author":"cai","year":"2019","journal-title":"arXiv 1910 06501"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2841936"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3338514"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09097218.pdf?arnumber=9097218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:08:28Z","timestamp":1641949708000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9097218\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2995812","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}