{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T04:45:19Z","timestamp":1774673119629,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T00:00:00Z","timestamp":1254355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T00:00:00Z","timestamp":1254355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of the Franklin Institute"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1016\/j.jfranklin.2009.07.002","type":"journal-article","created":{"date-parts":[[2009,7,30]],"date-time":"2009-07-30T10:16:18Z","timestamp":1248948978000},"page":"731-740","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":51,"title":["Cyclic DNA codes over the ring <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>F<\/mml:mi><\/mml:mrow><mml:mrow><mml:mn>2<\/mml:mn><\/mml:mrow><\/mml:msub><mml:mo stretchy=\"false\">[<\/mml:mo><mml:mi>u<\/mml:mi><mml:mo stretchy=\"false\">]<\/mml:mo><mml:mo>\/<\/mml:mo><mml:mo stretchy=\"false\">(<\/mml:mo><mml:msup><mml:mrow><mml:mi>u<\/mml:mi><\/mml:mrow><mml:mrow><mml:mn>2<\/mml:mn><\/mml:mrow><\/mml:msup><mml:mo>-<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo stretchy=\"false\">)<\/mml:mo><\/mml:math> based on the deletion distance"],"prefix":"10.1016","volume":"346","author":[{"given":"Irfan","family":"Siap","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taher","family":"Abualrub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Ghrayeb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/j.jfranklin.2009.07.002_bib1","doi-asserted-by":"crossref","first-page":"2126","DOI":"10.1109\/TIT.2003.815763","article-title":"On the generators of Z4 codes of length 2e","volume":"49","author":"Abualrub","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib2","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.jfranklin.2006.02.009","article-title":"Construction of cyclic codes over GF(4) for DNA computing","volume":"343","author":"Abualrub","year":"2006","journal-title":"Journal of The Franklin Institute"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10623-006-9034-5","article-title":"Cyclic codes over Z2+uZ2 and Z2+uZ2+u2Z2","volume":"42","author":"Abualrub","year":"2007","journal-title":"Designs, Codes and Cryptography"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1089\/cmb.1999.6.53","article-title":"On applying molecular computation to the Data Encryption Standard","volume":"6","author":"Adleman","year":"1999","journal-title":"Journal of Computational Biology"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib5","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","article-title":"Molecular computation of solutions to combinatorial problems","volume":"266","author":"Adleman","year":"1994","journal-title":"Science"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib6","unstructured":"D. Boneh, C. Dunworth, R. Lipton, Breaking DES using molecular computer, Princeton CS Tech-Report, Number CS-TR-489-95, 1995."},{"key":"10.1016\/j.jfranklin.2009.07.002_bib7","doi-asserted-by":"crossref","unstructured":"A. D\u2019yachkov, A. Macula, T. Renz, P. Vilenkin, I. Ismagilov, New results on DNA codes, in: International Symposium on Information Theory, September 2005, pp. 283\u2013287.","DOI":"10.1109\/ISIT.2005.1523339"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib8","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/B:JOCO.0000017385.39168.0d","article-title":"Exordium for DNA codes","volume":"7","author":"D\u2019yachkov","year":"2003","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib9","doi-asserted-by":"crossref","first-page":"4748","DOI":"10.1093\/nar\/25.23.4748","article-title":"Demonstration of a word design strategy for DNA computing on surfaces","volume":"25","author":"Frutos","year":"1997","journal-title":"Nucleic Acids Research"},{"issue":"1\u20133","key":"10.1016\/j.jfranklin.2009.07.002_bib10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.tcs.2004.11.004","article-title":"Linear construction for DNA codes","volume":"334","author":"Gaborit","year":"2005","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib11","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/18.312154","article-title":"The Z4-linearity of Kerdock, Preparata, Goethals, and related codes","volume":"40","author":"Hammons","year":"1994","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1726","article-title":"Bounds for DNA codes with constant GC-content","volume":"10","author":"King","year":"2003","journal-title":"The Electronic Journal of Combinatorics"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib13","first-page":"707","article-title":"Binary codes capable of correcting deletion, insertion, and reversal","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Journal of Soviet Physics\u2014Doklady"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib14","doi-asserted-by":"crossref","unstructured":"M. Mansuripur, P.K. Khulbe, S.M. Kuebler, J.W. Perry, M.S. Giridhar, N. Peyghambarian, Information storage and retrieval using macromolecules as storage media, University of Arizona Technical Report, 2003.","DOI":"10.1364\/ODS.2003.TuC2"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib15","doi-asserted-by":"crossref","unstructured":"O. Milenkovic, N. Kashyab, On the design of codes for DNA computing, in: Lecture Notes in Computer Science, vol. 3969, Springer, Berlin, 2006, pp. 100\u2013119.","DOI":"10.1007\/11779360_9"},{"issue":"5","key":"10.1016\/j.jfranklin.2009.07.002_bib16","doi-asserted-by":"crossref","first-page":"1594","DOI":"10.1109\/18.532906","article-title":"Cyclic codes and quadratic residue codes over Z4","volume":"42","author":"Pless","year":"1996","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.jfranklin.2009.07.002_bib17","doi-asserted-by":"crossref","unstructured":"I. Siap, Linear codes over F2+uF2 and their complete weight enumerators, Codes and Designs, Ohio State University Research Institute Publications 10, Walter de Gruyter, 2002, pp. 259\u2013271.","DOI":"10.1515\/9783110198119.259"}],"container-title":["Journal of the Franklin Institute"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0016003209000726?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0016003209000726?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T08:51:22Z","timestamp":1758012682000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0016003209000726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":17,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["S0016003209000726"],"URL":"https:\/\/doi.org\/10.1016\/j.jfranklin.2009.07.002","relation":{},"ISSN":["0016-0032"],"issn-type":[{"value":"0016-0032","type":"print"}],"subject":[],"published":{"date-parts":[[2009,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Cyclic DNA codes over the ring  based on the deletion distance","name":"articletitle","label":"Article Title"},{"value":"Journal of the Franklin Institute","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jfranklin.2009.07.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2009 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}