Research And Application Of DNA Computing Model Based On Plasmids

From 1994 to the present, the research of DNA computing has already gotten many exciting results. As an important branch of DNA computing, plasmid DNA computing has all compatible merits of DNA computing. At the same time, for the peculiar qualities of its cyclic structure, plasmid DNA carrier could be used as the unit effectively of DNA computer. The plasmid DNA computing model and the application in combinatorial and optimization problems of the graph are mainly published in this paper. Plasmid DNA unique molecular structure and biochemical characteristic are introduced in this paper at first. The mathematics model description based on the work of T.Head, etc is derived further. And the restriction enzyme of plasmid DNA can guarantee to realize accura- te computing. A kind of self-assemble grammar rule to set information sites structure of plasmid DNA is proposed. And a code method relied on GC content to change the melting temperature is published at the meantime. This kind of method can avoid truth expression in- accurate caused by too long DNA array. It is the main goal to solve the dynamic programming problem in this paper. The DNA computational analysis of the ZKP and 0-1 programming problem has been proposed. We introduced the strategy of Hofmeister to optimize initial solution and the TGGE code method of changing GC content. At last we give out the evaluation function of code arrays: support system for sequence design. The " similar quality" problem of the code could be erased maximum through SA algorithm. The biochemical experimental analysis course of 0-1 integer programming on the basis of plasmid DNA computing is published in this paper at the same time. TGGE ( Temperature Gradient Gel Electrophoresis ) rely on correlation of melting temperature of DNA sequence, and its susceptibility is extremely high, even changing one nucleotide in the sequence could lead to TGGE separate. PCR is a key in the whole course. Adopting the temperature gradient code method, in theory we could solve the dynamic programming problems with 1000 diffe- rent variables.At the end of the paper we summarize full paper, and give a forward to the system and works further, and summarize some development experience at last.