Several DNA Algorithms Of Minimum Vertex Cover Problem

The traditional computer can’t meet the development of the science of the situation due to their limited storage capacity and computing power already.In 1994, Adleman exploratorily combined modern biological technology and DNA operation technology, which successfully solved the seven nodes directed Hamilton path problem of empowerment graph. From then on, it opened the door of the biological DNA computing, which makes the DNA molecule to be a new kind of computer hardware possible. And because of DNA molecules are unmatched by traditional computer mass storage and the calculation of high parallelism, it becomes widely favored in cryptography, mathematics, computer and other fields has been.This article will introduce the specific DNA computing background, molecular structure of DNA, DNA molecular operation process such as basic theory, which concretely introduces the initial DNA code of the DNA molecule operation problem, including the basic concept of coding issues, the constraint conditions that the coding and coding method. This paper will also introduce the basic operation principle of commonly used DNA computing model and the advantages and disadvantages, including DNA paste model, the splicing model, molecular beacon, plasmid DNA and DNA from the assembly model.In addition, this article will introduce the specific minimum vertex cover problem, satisfiability problem, the basic concept of 0-1 programming problem, And clever form complex minimum vertex cover problem can be converted to simple 0-1 programming problem and satisfiability problem, this is also the innovation of this article. And based on this, we combine the model of plasmid DNA with DNA self-assembly basic algorithm and specific biological process, which has certain research significance.