An IGS Algorithm Applied to DNA Sequence Design

American scientist Adelman first used DNA molecules to solve the NP-complete problem, thus creating a new research field. As an advanced interdisciplinary subject, it has attracted many scholars because of its high parallelism, great storage density and low energy consumption. DNA sequence design is critical in the field of DNA computing. The success of DNA computing depends on the quality of DNA sequence. In this paper, we proposed an improved gravitational search algorithm for DNA sequence design. We improved the gravitational coefficient and introduced chaotic system and Gaussian mutation to the position update of the particles. We compared the result from our improved algorithm with the result obtained by other algorithms. The result shows that our proposed algorithm can generate high quality DNA sequence for DNA computing.