Designing Of DNA Sequence Based On Improvd Genetic Algorithm

DNA computing is a new method that uses biological molecule DNA as computing medium and biochemical reaction as computing tools. In 1994, Dr Adleman released"Molecular Computation of Solutions to Combinatorial Problems"in Science, which indicates DNA computing comes into being. The DNA molecule has a high parallelism, and a great of storage capacity as a carrier of information. There are the merits of DNA computing. At the same time, the resource of DNA molecule is very rich. Along with the development of biologic technology, the DNA computing will solve more and more complex problems, especially NP problems. Finally, it will product a new DNA computer which could bring the flying development of Mathematics, Computer Science and other subjects.In DNA computing, the core reaction is the specific hybridization between DNA sequences or the Watson-Crick complement, and which directly influences the reliability of DNA computation with its efficiency and accuracy. The efficiency and accuracy is influenced by DNA sequences, so how to product good DNA sequences is very important for improving the efficiency and reliability of DNA computing. At present, these are two researchful aspects about DNA sequences coding: on the one hand, it is the quality optimization of DNA sequences coding; on the other hand, it is the designing of DNA sequences coding sets. This paper counters these two aspects to do penetrating research, and puts emphasis on the research about the designing of DNA sequences sets.The main researchful content of the quality optimization of DNA sequences is that: according to the scale of problem, it is to search a certain amount of DNA sequences which satisfy the combinatorial constraints. The common constraints include the Hamming distance constrain, thermodynamics constrain and combinatorial constraints. The two main researchful methods are the theoretical contract and the searching by computer. At present, the research about the DNA sequences is relatively mature, and has developed software which has better ability. This paper which uses the improved genetic algorithm optimizes the quality of DNA sequences. These DNA sequences which are obtained by the improved genetic algorithm not only satisfy the DNA constraints, but also comparing with the previous works, have a significantly improvement.The main researchful content of the designing of DNA sequence sets is that: according to the known the length and the constraints, it is to search all the maximum of DNA sequences sets which satisfy the constraints. The common constraints include the Hamming distance constrain, thermodynamics constrain and combinatorial constraints. It includes two main methods one of which is theoretical research, other is research of algorithm. According to the constrains and the characteristic of the designing of DNA sequences sets, this paper ulteriorly improves the genetic algorithm and uses it to research the designing of DNA sequences sets. It not only makes the algorithm improved, but also obtains the results which are better than previous works.