The Application Of Molecular Beacons In DNA Computation

Adleman's work showed that it is feasibe to use DNA molecular for particular purpose calculation, after that, many scholars did unremitting effort in this filed, and there are many good results come out too. Because of the biochemical technology lags behind the requirement of DNA algorithm, DNA computing faces many significant challenges.In this paper, according to the encoding method of molecular beacons and the hairpin structure as well as the specificity of molecular beacons, we make a study and discussion of problems in interger programming and operational research. First we introduce the basic idea of DNA computing,and then we discuss the encoding problem in detail, which is one of the important and difficult problem in DNA computing, practices have proved that by efficient design of encoding could enhance the reliability of the process of DNA computing. In DNA computing, the information is based on DNA sequence as the carrier and complete the information processing by the specific hybridization between DNA molecularals. Whereas, the encoding problem is the most central issue in the entirely DNA computing, the purpose of encoding is expression and transmission of information. Then we mainly introduce the hairpin structure and the principle of molecular beacons. Molecular beacon is a kind of DNA ingeniously designed probe which is fluorescently-labeled. Specific molecular beacon hairpin structure has highly specific recognition ability to the target sequence. And it has become a powerful research tools in the filed of molecular biology and biotechnology. In 1996, Tyagi and Krammer established a molecular beacon probes for the first time, the initial purpose is determination the amount of the target object quantitatively in liquid. Molecular beacons have the advantage of simple structure, high sensitivity, rapid response, etc. Finally we take molecular beacons as the carrier of DNA computing, trying to solve the 0-1 programming problem and established a model of using the implicit enumation to solve the 0-1 programming problem. Then summarize the DNA computing model of SAT and MAX-SAT problem, the model of using DNA chip in 0-1 programming problem, and the model of subset sum problem.Figure [thirty-five] table [three] reference [sixty]...