IEEE Access · 2017 · 13 citations · 27 references
ComputingBioinformaticsGenome EngineeringGenomic Data AnalysisQuantum ComputingCoding TheoryComputational Quantum MechanicsCrossover OperatorsGenetic AlgorithmsGenetic CodeQuantum AlgorithmsCode DesignDna Circuit DesignDna ComputingMutationQuantum Chaos
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.
27
Quantitative Monitoring of Gene Expression Patterns with a Complementary DNA Microarray
Mark Schena, Dari Shalon, Ronald W. Davis et al. · Science · 1995 · 9.6K citations
Molecular Computation of Solutions to Combinatorial Problems
Leonard M. Adleman · Science · 1994 · 4.5K citations
<i>An Introduction to Chaotic Dynamical Systems</i>
Robert L. Devaney, Jean‐Pierre Eckmann · Physics Today · 1987 · 2.4K citations
An introduction to chaotic dynamical systems
Acta Applicandae Mathematicae · 1990 · 1.6K citations · Full text