DNA Computing Model Research And Explore

Dr. Adleman encoding DNA strands to the Hamiltonian road of seven vertices. Connected, denatured, PCR amplification, electrophoresis, etc biological operations were applied to this text. The success of the experiment inaugurated a new page for the molecular computing especially for DNA computation. DNA chain as the carrier of genetic information includes a mass of genetic code. And it has a huge parallelism. The problems like satisfiability problem, vertex cover problem, group, and independent set question and so on NP complete problems have a new train of thought-DNA computing. More and more specialists and scholars struggle to DNA computing combined with other subjects or algorithm to solve more actual problems.This thesis first introduces some background knowledge of the minimum spanning tree and satisfiability problem and research status, followed by the start of DNA computing coding and some commonly used calculation model are summarized. Third, introduces gel electrophoresis method to solve the minimum support tree related problems in details. And the thermodynamics properties of DNA strand needed. The weight of the edge is different the melting temperature of DNA strand is not alike and the speed of the gel electrophoresis is different. According to this method get all the minimum spanning tree of the graph. A graph has five vertexes as an example for proof the simple of this method. The fourth introduce the Satisfiability problem based on self-assembly of DNA molecular beacon model. This chapter is based on DNA self-assembly model. The DNA strands can self-assemble to molecular beacon structure through encoding the special complementary DNA strands. Then the chapter proposed a DNA algorithm based on molecular beacon structure by using the method of fluorescence changing for the satisfiability problem. The special complementary strands hybridized with the DNA strands in the initial data pool. The combination of DNA strands with fluorescence makes the clauses true. It is easy to judge the feasible solution. The key of the satisfiability problem is the fluorescence changing of the molecular beacon structure. We record the results by taking photos. The operation process of the algorithm is simple and the result of the algorithm is easy to be observed.