DNA Computing Research On Two Kinds Of Difficult Problems

DNA computing is a new kind of biological computing method at the molecular level, which is DNA sequence carried the genetic information and some enzymes for the most basic material, uses the biological actions to implement information processing.In1994, Adleman first proposed DNA computing method to solve the NP complete problems, which had provided s a new method to solve the NP-complete problem. Ever since then, the scholars have constantly studied using DNA molecules, or other biological molecules to make calculation process and have made some progress. The basic theory of DNA computing is:Using the special structure of DNA double helix and base match character, encode information and map it to the corresponding DNA chain, build a data pool with the help of enzymes. And then according to a series of experimental steps, map the raw data of the problem after computing to the biochemical reaction process of the DNA molecule chain. At last, using modern molecular biological technology, detect the required operation result.Starting from the basic theory problem of DNA computing, this paper studies the DNA computing model and its application in dealing with two kinds of difficult problems. Specific research contents are as follows:This paper discusses the plasmid DNA computing model and the closed circle DNA computing model. Plasmid DNA computing model is on the basis of closed circle plasmid DNA. In this model, the used plasmids have a special DNA inserted sequence. All of the fragments are determined in the corresponding restriction sites. Use cut and paste operation to complete DNA computing process. The closed circle DNA computing model and the plasmid DNA computing model have many similarities and differences. The closed circle DNA computing model has more research value and wider application range.Plasmid DNA algorithm of the minimal vertex covering problem is proposed upon the basic idea and operation of plasmid DNA computing model. In the plasmid DNA algorithm, though an appropriate encoding and the basic biological operation, finish the generation and separation of solution.Closed circle DNA algorithm of maximum weighted independent set problem is proposed upon closed circle DNA computing model and its biochemistry experiment. In the algorithm, first get all independent sets though an appropriate encoding and deleting experiments, and then find the maximum weighted independent set using other experiments.