Application In DNA Computing Using Hairpin Structure And Molecular Beacons

Many results have been gotten in the field of DNA computing since 1994. Many scholars are engaged in the research of DNA computing. But DNA computing faces more and more challenges with this field's progress. This challenge comes from the lag between the biochemistry technology and the DNA computing. In DNA computing field, when the problems which are solved using DNA computing become more and more complex, the operation and measure will become more and more complex. So, this problem must be solved in DNA computing field. To solve this problem, applications of hairpin structure of biology and molecular beacons are attractive. Because of the specialty of hairpin structure and molecular beacons, this problem can be solved effectively. They can be carriers of DNA computing. In this paper, hairpin structure and molecular beacons are applied in solving a few NP complete problems. Basic thinking of DNA computing is introduced in this paper, then the solution of SAT problem is introduced. After this , we introduce the principle and design of molecular beacons. In this paper, molecular beacons are used to solve SAT problem, MAX-SAT problem and subset-sum problem as carriers of DNA computing. The DNA computing module is constructed. On the basic of solving these NP complete problems, with optical characteristic of molecular beacons, I summarize the DNA computing of 0-1 integer programming problem, then bring forward a DNA computing module with light, electricity and computer. This attempt partially solves the problem of testing outcome hardly and makes DNA computing automation . At last, the paper is summarized and further research is brought forward.