Solving satisfiability problems using a novel microarray-based DNA computer

Che-Hsin Lin, Hsiao-Ping Cheng, Chang-Biau Yang, Chia-Ning Yang
2007 Biosystems (Amsterdam. Print)  
An algorithm based on a modified sticker model accompanied with an advanced MEMS-based microarray technology is demonstrated to solve SAT problem, which has long served as a benchmark in DNA computing. Unlike conventional DNA computing algorithms needing an initial data pool to cover correct and incorrect answers and further executing a series of separation procedures to destroy the unwanted ones, we built solutions in parts to satisfy one clause in one step, and eventually solve the entire
more » ... ean formula through steps. No time-consuming sample preparation procedures and delicate sample applying equipment were required for the computing process. Moreover, experimental results show the bound DNA sequences can sustain the chemical solutions during computing processes such that the proposed method shall be useful in dealing with large-scale problems.
doi:10.1016/j.biosystems.2006.08.009 pmid:17029765 fatcat:sosbehog5bfezlaubtk64je5hm