Implementation of a random walk method for solving 3-SAT on circular DNA molecules

Abstract

In a DNA computation a select operation is used to separate DNA molecules with different sequences. The implementation of the select operation requires specialized hardware and non-standard modification of DNA molecules by adding e.g., magnetic beads to a primer sequence or using other methods to separate DNA in solution. In this paper we consider DNA computations which use enzymatic reactions and secondary structure formation to perform computations. We show that it is possible to implement an efficient (exponential-time) probabilistic algorithm to solve instances of the satisfiability problem on circular single stranded DNA. © Springer-Verlag Berlin Heidelberg 2003.