Some DNA Computing Methods For Error Permutation Problems

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 core matter of DNA computing is letting the encoded DNA strands as input, and in test tube or other carrier take place specific bio-chemical reactions controlled, then achieved the computing procedure to give the whole result space after the reaction. The intrinsic idea of DNA computing is that: utilizing DNA molecules and Watson-Crick complement rule to encode information, i.e. computing objects are firstly mapped into DNA strands, then with biological enzymes, various data pool are generated, followed by, a series of highly parallel controllable bio-chemical procedures of DNA strands, and finally, biology techniques, for example, polymerase chain reaction (PCR), ultrasonic degrading, affinity chromatography, molecular cloning, induced mutagenesis, molecule purification, electrophoresis and magnetic separation, etc. are used to detect computing results.In this paper, the application of DNA computing to combination is introduced, and we explore solving the issue that time complexity must transform into space complexity inherited in current DNA computing model, and we set up some DNA computing models on the error permutation problem. On the basis of the experimental bio-molecular method, the algorithm is an effective method, the advantage and disadvantage are discussed, and the future research directions are pointed out.