{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T11:51:43Z","timestamp":1744372303864,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T00:00:00Z","timestamp":1600992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T00:00:00Z","timestamp":1600992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10623-020-00802-2","type":"journal-article","created":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T18:02:45Z","timestamp":1601056965000},"page":"2581-2596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Construction of single-deletion-correcting DNA codes using CIS codes"],"prefix":"10.1007","volume":"88","author":[{"given":"Whan-Hyuk","family":"Choi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8400-3222","authenticated-orcid":false,"given":"Hyun Jin","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Yoonjin","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,25]]},"reference":[{"issue":"10","key":"802_CR1","doi-asserted-by":"publisher","first-page":"5223","DOI":"10.1109\/TIT.2010.2059790","volume":"56","author":"KA Abdel-Ghaffar","year":"2010","unstructured":"Abdel-Ghaffar K.A., Ferreira H.C., Cheng L.: Correcting deletions using linear and cyclic codes. IEEE Trans. Inform. Theory 56(10), 5223\u20135234 (2010).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"802_CR2","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.disc.2011.11.021","volume":"312","author":"N Aboluion","year":"2012","unstructured":"Aboluion N., Smith D.H., Perkins S.: Linear and nonlinear constructions of DNA codes with Hamming distance $$d$$, constant GC-content and a reverse-complement constraint. Discret. Math. 312(5), 1062\u20131075 (2012).","journal-title":"Discret. Math."},{"key":"802_CR3","first-page":"65","volume":"186","author":"S Baker","year":"2007","unstructured":"Baker S., Flack R., Houghten S.: Optimal variable-length insertion-deletion correcting codes and edit metric codes. Congr. Numer. 186, 65\u201380 (2007).","journal-title":"Congr. Numer."},{"key":"802_CR4","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.procs.2016.05.398","volume":"80","author":"M Blawat","year":"2016","unstructured":"Blawat M., et al.: Forward error correction for DNA data storage. Proc. Comput. Sci. 80, 1011\u20131022 (2016).","journal-title":"Proc. Comput. Sci."},{"key":"802_CR5","volume-title":"An Introduction to Magma","author":"J Cannon","year":"1994","unstructured":"Cannon J., Playoust C.: An Introduction to Magma. University of Sydney, Sydney (1994)."},{"key":"802_CR6","doi-asserted-by":"publisher","first-page":"6000","DOI":"10.1109\/TIT.2012.2200651","volume":"58","author":"C Carlet","year":"2012","unstructured":"Carlet C., Gaborit P., Kim J.-L., Sol\u00e9 P.: A new class of codes for Boolean masking of cryptographic computations. IEEE Trans. Inform. Theory 58, 6000\u20136011 (2012).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1\u20133","key":"802_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2004.11.004","volume":"334","author":"P Gaborit","year":"2005","unstructured":"Gaborit P., King O.D.: Linear constructions for DNA codes. Theor. Comput. Sci. 334(1\u20133), 99\u2013113 (2005).","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"802_CR8","doi-asserted-by":"publisher","first-page":"2550","DOI":"10.1109\/TIT.2017.2778143","volume":"64","author":"R Gabrys","year":"2018","unstructured":"Gabrys R., Yaakobi E., Milenkovic O.: Codes in the Damerau distance for deletion and adjacent transposition correction. IEEE Trans. Inform. Theory 64(4), 2550\u20132570 (2018).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"802_CR9","doi-asserted-by":"publisher","first-page":"4996","DOI":"10.1109\/TIT.2017.2688361","volume":"63","author":"S Jain","year":"2017","unstructured":"Jain S., et al.: Duplication-correcting codes for data storage in the DNA of living organisms. IEEE Trans. Inform. Theory 63(8), 4996\u20135010 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"802_CR10","unstructured":"Kim H.J., Choi W.-H., Lee Y.: Designing DNA codes from reversible self-dual codes over $$GF(4)$$. preprint."},{"key":"802_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2020.101714","author":"HJ Kim","year":"2020","unstructured":"Kim H.J., Choi W.-H., Lee Y.: Construction of reversible self-dual codes. Finite Fields Appl. (2020). https:\/\/doi.org\/10.1016\/j.ffa.2020.101714.","journal-title":"Finite Fields Appl."},{"key":"802_CR12","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10623-015-0174-3","volume":"81","author":"HJ Kim","year":"2016","unstructured":"Kim H.J., Lee Y.: Complementary information set codes over $$GF(p)$$. Des. Codes Cryptogr. 81, 541\u2013555 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"802_CR13","doi-asserted-by":"publisher","first-page":"R33","DOI":"10.37236\/1726","volume":"10","author":"OD King","year":"2003","unstructured":"King O.D.: Bounds for DNA codes with constant GC-content. Electron. J. Comb. 10, R33 (2003).","journal-title":"Electron. J. Comb."},{"key":"802_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disc.2013.11.003","volume":"317","author":"AA Kulkarni","year":"2014","unstructured":"Kulkarni A.A., Kiyavash N., Sreenivas R.: On the Varshamov-Tenengol\u2019ts construction on binary strings. Discret. Math. 317, 79\u201390 (2014).","journal-title":"Discret. Math."},{"issue":"8","key":"802_CR15","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Doklady 10(8), 707\u2013710 (1966).","journal-title":"Sov. Phys. Doklady"},{"issue":"3","key":"802_CR16","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1515\/dma.1992.2.3.241","volume":"2","author":"VI Levenshtein","year":"1992","unstructured":"Levenshtein V.I.: On perfect codes in deletion and insertion metric. Discret. Math. Appl. 2(3), 241\u2013258 (1992).","journal-title":"Discret. Math. Appl."},{"key":"802_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1089\/10665270152530818","volume":"8","author":"A Marathe","year":"2001","unstructured":"Marathe A., Condon A.E., Corn R.M.: On combinatorial DNA design. J. Comp. Biol. 8, 201\u2013219 (2001).","journal-title":"J. Comp. Biol."},{"issue":"1","key":"802_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/SURV.2010.020110.00079","volume":"12","author":"H Mercier","year":"2010","unstructured":"Mercier H., Bhargava V.K., Tarokh V.: A survey of error-correcting codes for channels with symbol synchronization errors. IEEE Commun. Surv. Tutor. 12(1), 87\u201396 (2010).","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"802_CR19","unstructured":"SageMath, the Sage Mathematics Software System (Version 8.6). The Sage Developers (2018) https:\/\/www.sagemath.org."},{"key":"802_CR20","doi-asserted-by":"crossref","unstructured":"Schoeny C., Sala F., Dolecek L.: Novel combinatorial coding results for DNA sequencing and data storage. In: 2017 51st Asilomar Conference on Signals, Systems, and Computers. IEEE, pp. 511\u2013515 (2017).","DOI":"10.1109\/ACSSC.2017.8335392"},{"key":"802_CR21","unstructured":"Sloane N.J.: On single-deletion-correcting codes. In: Proc. Codes and designs (Columbus, OH, 2000), pp. 273\u2013291, Ohio State Univ. Math. Res. Inst. Publ., Berlin (2002)."},{"issue":"4","key":"802_CR22","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/LCOMM.2017.2649492","volume":"21","author":"D Smith","year":"2017","unstructured":"Smith D., et al.: Interleaved constrained codes with markers correcting bursts of insertions or deletions. IEEE Commun. Lett. 21(4), 702\u2013705 (2017).","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"802_CR23","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/TCBB.2014.2299815","volume":"11","author":"D Tulpan","year":"2014","unstructured":"Tulpan D., Smith D.H., Smith R.: Thermodynamic post-processing versus GC-content pre-processing for DNA codes satisfying the Hamming distance and reverse-complement constraints. IEEE\/ACM Trans. Comput. Biol. Bioinform. 11(2), 441\u2013452 (2014).","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"802_CR24","unstructured":"Varbanov Z., Todorov T., Hristova M.: A method for constructing DNA codes from additive self-dual codes over GF(4). In: Proc. CAIM conference, Romania, vol. 40 (2014)."},{"issue":"2","key":"802_CR25","first-page":"288","volume":"26","author":"RR Varshamov","year":"1965","unstructured":"Varshamov R.R., Tenengol\u2019ts G.M.: Code correcting single asymmetric errors. Avtomat. Telemekh. 26(2), 288\u2013292 (1965).","journal-title":"Avtomat. Telemekh."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00802-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-020-00802-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00802-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T02:09:40Z","timestamp":1632535780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-020-00802-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,25]]},"references-count":25,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["802"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00802-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2020,9,25]]},"assertion":[{"value":"2 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}