A Space-Efficient Randomized DNA Algorithm for k-SAT

We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds a satisfying assignment, assuming one exists, with probability 1-e, in worst-case time O(k2 mn) and space O(2(1- 1 k )n+log ). This makes it the most space-efficient DNA k-SAT algorithm for k > 3 and k < n/ log (i.e. the clause size is small compared to the number of variables). In addition, our algorithm is the first DNA algorithm to adapt techniques from the field of randomized classical algorithms.

• Type: Conference
• Year: 2000
• Where: DNA
• Authors: Kevin Chen, Vijay Ramachandran
• Keywords: Algorithm, Bioinformatics, Classical Algorithms, DNA 2000, DNA Algorithm