Solving satisfiability problems using a novel microarray-based DNA computer
| Autor: | Che-Hsin Lin, Hsiao-Ping Cheng, Chia-Ning Yang, Chang-Biau Yang |
|---|---|
| Rok vydání: | 2007 |
| Předmět: |
Statistics and Probability
Theoretical computer science Peptide computing Sample (material) Computing Methodologies General Biochemistry Genetics and Molecular Biology law.invention Computers Molecular DNA computing law Computer Simulation Molecular Biology Oligonucleotide Array Sequence Analysis Mathematics Models Genetic Series (mathematics) Nucleotides True quantified Boolean formula Applied Mathematics Process (computing) Computational Biology DNA General Medicine Models Theoretical Satisfiability Modeling and Simulation Benchmark (computing) Nucleic Acid Conformation Algorithm Algorithms |
| Zdroj: | Biosystems. 90:242-252 |
| ISSN: | 0303-2647 |
| DOI: | 10.1016/j.biosystems.2006.08.009 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect