DNA Code Design Based on the Bloch Quantum Chaos Algorithm

• Published in: IEEE access Vol. 5; pp. 22453 - 22461
• Main Authors: Guo, Qingji, Wang, Bin, Zhou, Changjun, Wei, Xiaopeng, Zhang, Qiang
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.01.2017; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Algorithms; Bloch quantum chaos algorithm; Chaos; chaotic; Codes; Combinatorial analysis; Crossovers; Data encryption; Data storage; Deoxyribonucleic acid; DNA; DNA code design; Encryption; Hamming distance; Heuristic algorithms; High definition video; Mutation; Optimization; Qubits (quantum computing); Strategy; whole interference crossover
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2017.2760882

The design of DNA codes sets satisfying certain combinatorial constraints is important in reducing hybridization errors due to nonspecific hybridization between distinct codes and their complements in DNA computing, data encryption, and data storage. The DNA code design problem is to find the largest possible set of DNA codes. In this paper, we present a Bloch quantum chaos algorithm for the designing DNA codes sets. The algorithm uses the chaotic equation to initialize the Bloch coordinates of quantum bits, next adopts the whole interference crossover strategy to get crossover operation, then employs quantum non gate strategy to get mutation operation, finally utilizes the dynamic adjustment strategy to adjust the quantum rotation corner. Several experimental results in which our algorithm finds DNA codes sets match or exceed the best previously known constructions.