کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
2076835 1079466 2007 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Solving satisfiability problems using a novel microarray-based DNA computer
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات مدل‌سازی و شبیه سازی
پیش نمایش صفحه اول مقاله
Solving satisfiability problems using a novel microarray-based DNA computer
چکیده انگلیسی

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 Boolean 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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Biosystems - Volume 90, Issue 1, July–August 2007, Pages 242–252
نویسندگان
, , , ,