{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T10:45:49Z","timestamp":1760784349551,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61425002","61772100","61402066","61672121","61672051","61572093","61402067","61370005","31370778"],"award-info":[{"award-number":["61425002","61772100","61402066","61672121","61672051","61572093","61402067","61370005","31370778"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program for Changjiang Scholars and Innovative Research Team in University","award":["IRT_15R07"],"award-info":[{"award-number":["IRT_15R07"]}]},{"name":"Program for Liaoning Innovative Research Team in University","award":["LT2015002"],"award-info":[{"award-number":["LT2015002"]}]},{"name":"Basic Research Program of the Key in Liaoning Province Educational Department","award":["LZ2014049","LZ2015004"],"award-info":[{"award-number":["LZ2014049","LZ2015004"]}]},{"name":"Scientific Research Fund of Liaoning Provincial Education","award":["L2015015","L2014499"],"award-info":[{"award-number":["L2015015","L2014499"]}]},{"name":"Program for Liaoning Key Lab of Intelligent Information Processing and Network Technology in University"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/access.2017.2760882","type":"journal-article","created":{"date-parts":[[2017,10,9]],"date-time":"2017-10-09T18:10:18Z","timestamp":1507572618000},"page":"22453-22461","source":"Crossref","is-referenced-by-count":11,"title":["DNA Code Design Based on the Bloch Quantum Chaos Algorithm"],"prefix":"10.1109","volume":"5","author":[{"given":"Qingji","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaopeng","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3776-9799","authenticated-orcid":false,"given":"Qiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Tables of Lower Bounds for DNA Codes With Constant GC-Content","year":"2008","author":"king","key":"ref38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2007.11.017"},{"key":"ref32","first-page":"65","author":"devaney","year":"1989","journal-title":"An Introduction to Chaotic Dynamical Systems"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2009.10.001"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2011.10.023"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2014.2299815"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"33","DOI":"10.37236\/1726","article-title":"Bounds for DNA codes with constant GC-content","volume":"10","author":"king","year":"2003","journal-title":"Electron J Combinat"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911167"},{"key":"ref34","first-page":"61","article-title":"Quantum-inspired genetic algorithms","author":"narayanan","year":"2002","journal-title":"Proc IEEE Int Conf Evol Comput"},{"key":"ref10","first-page":"9","article-title":"Genetic search of reliable encodings for DNA based computation","author":"deaton","year":"1996","journal-title":"Proc Late Breaking Papers Genet Program"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36440-4_20"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44886-1_31"},{"key":"ref13","first-page":"205","article-title":"On template method for DNA sequence design","author":"kobayashi","year":"2002","journal-title":"Proc Int Workshop DNA-Based Comput DNA Comput"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNB.2010.2069570"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-008-9087-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11925903_12"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.11.004"},{"key":"ref18","first-page":"1207","article-title":"Linear and nonlinear Constructions of DNA codes with Hamming distance d and constant $GC$ -content","volume":"312","author":"smith","year":"2012","journal-title":"Discrete Math"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057277"},{"key":"ref28","first-page":"1354","article-title":"Genetic quantum algorithm and its application to combinatorial optimization problem","volume":"2","author":"han","year":"2002","journal-title":"Proc Congr Evol Comput"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.optlaseng.2015.03.022"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542334"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.89.12.5381"},{"journal-title":"Natural data storage A review on sending information from now to then via nature","year":"2015","author":"limbachiya","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.4304\/jsw.6.7.1297-1304"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1016\/j.asoc.2012.01.016","article-title":"Image encryption using DNA complementary rule and chaotic maps","volume":"12","author":"wang","year":"2012","journal-title":"Appl Soft Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1089\/10665270152530818"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000006772.32105.46"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.270.5235.467"},{"journal-title":"The art of DNA strings Sixteen years of DNA coding theory","year":"2016","author":"limbachiya","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.7973651"},{"key":"ref20","first-page":"167","article-title":"Three metaheuristics for the construction of constant GC-content DNA codes","volume":"6","author":"montemanni","year":"2014","journal-title":"Lecture Notes in Management Sci"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2006.02.009"},{"article-title":"The construction of DNA codes using a computer algebra system","year":"2011","author":"niema","key":"ref21"},{"key":"ref24","first-page":"101","article-title":"On cyclic DNA codes over F4 [u]\/(u2+1)","volume":"24","author":"ma","year":"2015","journal-title":"Int J Res Rev Appl Sci"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1049\/el.2010.3397"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2015.10.008"},{"journal-title":"On cyclic DNA codes over the ring Z4+uZ4","year":"2015","author":"pattanayak","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7859429\/08062799.pdf?arnumber=8062799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:59:31Z","timestamp":1633921171000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8062799\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2760882","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2017]]}}}