• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science ›› 2021, Vol. 43 ›› Issue (09): 1529-1537.

Previous Articles     Next Articles

A computational model for satisfiability problem based on DNA origami

WANG Xin-yi1,YIN Zhi-xiang2,TANG Zhen1,YANG Jing1,CUI Jian-zhong3,4#br#

#br#
  

  1. (1.School of Mathematics and Big Data,Anhui University of Science and Technology,Huainan 232001;

    2.School of Mathematics,Physics and Statistics,Shanghai University of Engineering Science,Shanghai 201620;

    3.School of Electrical and Information Engineering,Anhui University of Science and Technology,Huainan 232001;

    4.Department of Computer Science,Huainan Union University,Huainan 232001,China)

  • Received:2020-03-26 Revised:2020-09-22 Accepted:2021-09-25 Online:2021-09-25 Published:2021-09-24

Abstract: DNA origami is a new DNA self-assembly method, which has the advantages of programmability and nano-addressability, and is widely used in DNA computing. In this paper, a computational model on DNA origami substrate for solving the satisfiability problem is designed on the basis of DNA origami that can fold special structures. This model adopts the principle of molecular beacon and eliminates the non-solution by observing the luminescence, so as to find the solution of the satisfiability problem, and the feasibility of the model is proved by examples and simulation.

Key words: DNA origami, molecular beacon, satisfiability problem, model simulation