Maximum Matching Problem Of DNA Algorithms Rearch

DNA computing has been a touchy point for research in mathematics, biology, chemistry, and computer science in recent years. The DNA computing is a new method that simulates the structure DNA of biology molecule and does the computing by molecule biological technology. Its goal is to produce a new generation computer which takes the DNA computing model as the background and has the magnanimous memory genetic code and the extremely quick running rate. The basic theory of DNA computing is:Encode information using the special structure of DNA double helix and nucleotides match rule, and mapping the object to operating to DNA molecules strands, and build a data pool, then use the rules appointed mapping the DNA molecules strands to a high speed parallel data computing bio-chemistry procedure. It has inestimable superiority in solving in the massively parallel estimation problem. Current DNA computing models include the sticker-model, plasmid-model and double-stranded DNA model.The Maximum Matching Problem (MMP) is a classic combination and optimization problem in graph theory, widely used in wireless network planning, network routing, communication network construction, best planning, and other real applications. In recent years, some researchers have proposed some DNA algorithm to solve MMP, such as plasmid-model and surface-model to solve MMP and sticker-model to solve perfect matching problem. In this paper, we will give a new DNA algorithm to solve MMP in arbitrary graph and propose how to solve the problem of movement-assisted deployment by this algorithm.The innovation of this paper is to solve MMP in arbitrary graph by applying biotechnology-based DNA algorithm. And the new algorithm solves the problem of movement-assisted deployment in wireless sensor networks. The DNA algorithm provides a new programming idea for our study. DNA parallel computing capability has a broad outlook for application.