A MEMS based DNA computer for solving SAT problems

被引:0
|
作者
Yang, Chia-Ning [1 ]
Cha, Chien-Hsiang [2 ,3 ]
Cheng, Hsiao-Ping [2 ]
Lin, Che-Hsin [2 ,3 ]
机构
[1] I Shou Univ, Dept Med Imaging & Radiol Sci, Saga 840, Japan
[2] Natl Sun Yat Sen Univ, Dept Mech & Electro Mech Engn, Kaohsiung 804, Taiwan
[3] Natl Sun Yat Sen Univ, Ctr Nanosci & Nanotechnol, Kaohsiung 804, Taiwan
关键词
SAT problem; DNA computing; back-side; exposure; MEMS-based microarray;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a novel MEMS-based DNA computer for solving SAT problems. A modified back-side exposure process and a low-cost fluorescent microscope system for image acquisition are used for the computing experiment such that no time-consuming alignment procedures and delicate sample applying equipment are required for the proposed microarray-based DNA computing. Moreover, experimental results show the bound DNA sequences can sustain the chemical solutions and multiple UV exposures during computing processes such that the proposed method shall be useful in dealing with large scale problems. An algorithm based on a modified sticker model accompanied with a state-of-the-art MEMS-based microarray experiment is demonstrated to solve SAT problem which has long served as a benchmark in DNA computing. Unlike conventional DNA computing algorithms need an initial data pool to cover all correct and incorrect answers and further execute 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. Accordingly this algorithm greatly reduces the formation of unnecessary candidate solutions and shall be very practical as problem size grows.
引用
收藏
页码:172 / 177
页数:6
相关论文
共 50 条
  • [21] Discrete Lagrangian-based search for solving MAX-SAT problems
    Wah, BW
    Shang, Y
    IJCAI-97 - PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 1997, : 378 - 383
  • [22] Variational satisfiability solving: efficiently solving lots of related SAT problems
    Jeffrey M. Young
    Paul Maximilian Bittner
    Eric Walkingshaw
    Thomas Thüm
    Empirical Software Engineering, 2023, 28
  • [23] Analog dynamics for solving max-SAT problems
    Molnar, Botond
    Ercsey-Ravasz, Maria
    2014 14TH INTERNATIONAL WORKSHOP ON CELLULAR NANOSCALE NETWORKS AND THEIR APPLICATIONS (CNNA), 2014,
  • [24] OPTSAT: A tool for solving SAT related optimization problems
    Giunchiglia, Enrico
    Maratea, Marco
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4160 : 485 - 489
  • [25] Solving subset sum and SAT problems by reaction systems
    Aman, Bogdan
    Ciobanu, Gabriel
    NATURAL COMPUTING, 2024, 23 (02) : 177 - 187
  • [26] Solving periodic timetabling problems with SAT and machine learning
    Matos, Goncalo P.
    Albino, Luis M.
    Saldanha, Ricardo L.
    Morgado, Ernesto M.
    PUBLIC TRANSPORT, 2021, 13 (03) : 625 - 648
  • [27] Solving constraint satisfaction problems with SAT modulo theories
    Miquel Bofill
    Miquel Palahí
    Josep Suy
    Mateu Villaret
    Constraints, 2012, 17 : 273 - 303
  • [28] Solving over-constrained problems with SAT technology
    Argelich, J
    Manyà, F
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS, 2005, 3569 : 1 - 15
  • [29] Solving All-SAT Problems by P Systems
    GUO Ping
    JI Jinfang
    CHEN Haizhu
    LIU Ran
    Chinese Journal of Electronics, 2015, 24 (04) : 744 - 749
  • [30] Solving periodic timetabling problems with SAT and machine learning
    Gonçalo P. Matos
    Luís M. Albino
    Ricardo L. Saldanha
    Ernesto M. Morgado
    Public Transport, 2021, 13 : 625 - 648