Based On Triple-stranded DNA 0-1 Integer Programming

DNA computing is a novel molecular biological computing method, which various DNA-related biological enzymes are used as basic material and series of bio-chemical reactions are employed as procedure of computing. The appealing characteristics of DNA computing are vast genetic codes of DNA molecules as well as massive parallelism of bio-chemical reactions. Therefore, new generation of computer based on DNA computing model (so-called DNA computer) features vast memory space and fast running speed. In next generation DNA computer system, the genetic codes of DNA molecules are treated as stored data, when bio-chemical reaction occurs with enzymes, pre-reaction genetic codes transform into new post-reaction genetic codes. If pre-reaction codes behave as inputted data of DNA computer, the post-reaction codes can be considered as computing results. Thus, by means of various, precise and controllable bio-chemical reactions, next generation of DNA computer based on DNA chip may come into reality.In this paper, the main computing model, including surface-based, sticker, plasmids computing model and triple-stranded computing model were thoroughly introduced, from conformation of DNA molecules point of view. We explored solving the issue that time complexity must transform into space complexity inherited in current DNA computing model, by means of triple-stranded computing model. An instance of 0-1 integer programming model was solved by used of triple-stranded computing model . About integer programming problem, We transformed to 0-1 integer programming problem. At the same time, We also transformed Sat-problem to integer programming , thereby transformed to 0-1 integer programming problem. In this paper, we supplied DNA surface-based computing model and DNA chip model and other models to soved 0-1 integer programming problem.