Several Types Of DNA Algorithms For NP-complete Problems

DNA computing is a new method for the calculation carried out by the DNA molecular biological characteristics and biochemical reaction process, Has great advantages in solving NP-complete problem of fast computing than traditional computers.Special DNA encoding the control variables and the edge weight is incor-porated into the DNA sequence; shortest feasible solution to the road and then through the hybridization experiments and separation experiments; Obtained by electrophoresis experiments and testing experiments the shortest optimal solution to the problem of the road. Convert mathematical problems in the DNA chain, appropriate coding for each edge of the graph, and use of biological action and biological enzymes generate chain and end-chain separation. The calculation of the test tube-based the molecular biotechnology matching the DNA results show that the proposed algorithm is effective and feasible. Biochemical experiments solving cutset method to improve the traditional paste model, using this method to get the DNA algorithm of the minimum connection problem. Separation ex-perimental operation parallelism Solving cutset, minimum link DNA algorithm used time is decidable, reducing the time required by the algorithm.