| ¡¡ | Chinese Journal of Computers Full Text |
| Title | Genetic Algorithm-Based Design for DNA Sequences Sets |
| Authors | ZHANG Qiang WANG Bin ZHANG Rui XU Chun-Xia |
| Address | (Key Labortory of Advanced Design and Intelligent Computing (Dalian University) of Ministry of Education, Dalian, Liaoning 116622) |
| Year | 2008 |
| Issue | No.12(2193¡ª2199) |
| Abstract & Background | Abstract Both the quality and the quantity of DNA coding sequences immediately affect the reliability and the scale of DNA computing, and how to find more and better DNA sequences which are used in practical applications is the key problems in DNA computing. This paper firstly introduces the significance of DNA coding and DNA sequences sets for DNA computing, and then gives the definitions of the Hamming distance and reverse Hamming distance constraints. The research of DNA sequences sets has important effect on the reliability and the scale of DNA computing, so we use genetic algorithm and dynamic genetic algorithm were used to design the largest DNA sequence sets which satisfy Hamming distance and reverse Hamming distance combinatorial constraints. Comparing the results which are obtained by the two algorithms, it can be proven that the dynamic genetic algorithm is markedly better than genetic algorithm. At the same time, by comparing the obtained experimental results with the previous works, the obtained results improve the upper bounds of DNA coding, and further shorten the value range of DNA coding bounds. Furthermore, the results provide a guide for the research of theoretical bounds in DNA coding and the bounds of 4-ary in coding theory. Keywords DNA sequence sets;genetic algorithm; Hamming distance; reverse Hamming distance; dynamic genetic algorithm |