Font Size: a A A

Application Of DNA Computing In The Combinatorial Optimization Problem

Posted on:2012-11-15Degree:MasterType:Thesis
Country:ChinaCandidate:D P GaoFull Text:PDF
GTID:2218330374953610Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
In modern society, cultural and technical have a rapid development meanwhile all the technologies in various fields are interdisciplinary. Traditional computer technology is now being subjected to a bottleneck. However, with the development of biotechnology, a new. field of computer technology-DNA computing will change the problem. The reason why the DNA computing is a new field, is DNA computing has a strong parallelism, massive storage capacity and low power consumption and other characteristics, and this is just the difficulty of contemporary computer technology which is expected to be made up for deficiency of the existing serial computers by DNA computing.The basic principle of DNA computing is the double helix structure of DNA molecules and the WC base pairing coding principles, and then the practical issues will be mapped to the molecular chain of DNA, with the feasibility of the role of enzyme biological operations to generate all the data pool. And then following abstract issue specific rules the mapping of DNA molecules will be operated by biochemical controlled reactions. Finally, using molecular biological techniques (such as affinity chromatography, polymerase chain reaction PCR cloning, bead separation, mutagenesis, electrophoresis, molecular purification, etc.), to detect the possible result of the operation.Main problems of this study include several aspects:operation in DNA computing of the basic biology, DNA computing in the optimization of the coding constraints, integer programming algorithm improvement and implementation. And problem of recoding DNA computing is the most important issue, and is also the difficulty. In this paper, it will give a definition of encoding, and will analyze specific hybridization of DNA molecules. At the end of this paper, simulation will consider some of these factors, and meet the experimental requirements.Simulated operation of this article is the simulation of improved 0-1 integer programming algorithm. The simulated environment is implemented in VS2008 platform, and the program will design four classes of chain, Tube, chain algorithm and the tube algorithm as said DNA chain, tube, chain operations and tube operations. Finally, the article gives the specific problem of data mapping DNA chain, through software simulation of the improved algorithm to achieve the desired effect.
Keywords/Search Tags:DNA computing, 0-1 integer programming, encoding constraint
PDF Full Text Request
Related items