Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
