A Robust Dna Computation Model That Captures Pspace

One of the most serious problems in DNA computing is that basic DNA operations are faulty. Many DNA computation models use operations based on annealing and magnetic-beads separation which sometimes produce undesirable results. Some models use reliable operations only but their computational power is too weak. The purpose of this paper is to nd a good trade-o between the robustness of DNA operations and their computational power. We present a robust DNA computation model that can solve computationally hard problems. We prove that (i) this model can solve PSPACE- complete problems, and (ii) any computational problem that can be solved with this model is in PSPACE