On the lower bounds of DNA word sets for DNA computing

DNA computing is a new research field, which has been paid attention to by more and more experts with the DNA computing bringing the flying development of mathematics, computer science and other subjects. Because the DNA coding could decrease the emergence of false negative and false positive, it affects the reliability and the accuracy of DNA computing. In the DNA coding, DNA word sets could provide the best and effective DNA sequences which are used in DNA computing to improve the reliability and accuracy of biochemical reaction. However, there are no entire and exact values which satisfy combinational constraints, which induce many problems in DNA coding. For this reason, in this paper, we use the dynamic genetic algorithm to improve lower bounds of DNA word sets which satisfy combinational constraints. By comparing our experimental results with previous researchful work, the results improve the lower bounds and further shorten the value range of DNA word sets.