期刊文献+

动态DNA折纸计算模型的可满足性问题 被引量:1

Satisfiability of dynamic DNA origami computing model
下载PDF
导出
摘要 DNA折纸术与传统的DNA自组装技术不同,通过碱基互补配对能够可控地构造出高度复杂的纳米图案或结构.文中为了求解可满足问题设计了一种动态的折纸结构,该结构由DNA折纸卡槽、双态DNA机器、DNA行走机器人三部分组装而成.折纸卡槽由一条DNA长链和若干短链折叠而成,DNA行走机器人是由7条单链折成的三手四足DNA折纸结构,双态DNA机器分为修饰和不修饰荧光颗粒两种状态.DNA机器人的“手”通过链置换接收荧光颗粒,机器人的“脚”在链的驱动下以顺时针旋转120°在折纸卡槽和DNA双态机器组装而成的折纸基底上完成动态行走.根据可满足问题的约束变量选择性地接收荧光颗粒,每一步对应于一个变量的取值,以荧光团的个数映射问题的条件,以荧光团的颜色映射问题的解.该模型结构简单,其解易于观察,因而大大提高了模型的可行性和计算的准确性. DNA origami is different from traditional DNA self-assembly technology.It can construct highly complex nano-patterns or structures by base complementary pairing.In order to solve the problem of satisfiability,a dynamic origami structure is designed,which is composed of DNA origami slot,dual DNA machine and DNA walking robot.The origami slot is folded by a long strand of DNA and several short strands.The DNA walking robot is a three-handed quadruped DNA origami structure consisting of seven single strands.The bimorphic DNA machine can be divided into two states:modified and unmodified fluorescent particles.DNA robot’s“hand”receives fluorescent particles through chain replacement.The robot’s“foot”is driven by the chain and rotates 120 degrees clockwise on the origami base assembled by origami slot and DNA duplex machine to complete dynamic walking.According to the constrained variables that can satisfy the problem,fluorescent particles are selectively received.Each step corresponds to the value of a variable.The number of fluorescent groups is used to map the condition of the problem,and the solution of the color mapping problem of fluorescent groups is used.The model is simple in structure and its solution is easy to be observed,which greatly improves the feasibility of the model and the accuracy of calculation.
作者 陈哲 殷志祥 唐震 CHEN Zhe;YIN Zhixiang;TANG Zhen(School of Mathematics and Big Data,Anhui University of Technology,Huainan 232001,China)
出处 《南阳师范学院学报》 CAS 2020年第3期47-52,共6页 Journal of Nanyang Normal University
基金 国家自然科学基金(61672001,61702008) 安徽省自然科学基金(1808085MF193)。
关键词 DNA折纸术 可满足性问题 DNA行走机器人 荧光颗粒 DNA origami satisfiability DNA walking robot fluorescent particles
  • 相关文献

参考文献1

二级参考文献10

  • 1Freund R, Paun G, Rozenberg G, et al. Watson-Crick finite automata. In: Rubin H, Wood D H, eds. DNA based Computers Ⅲ, 48. Philadelphia: American Mathematical Society, 1999. 305-317.
  • 2Adleman L M. Molecular computation of solutions to combinatorial problems. Science, 1994, 266 (5187): 1021-1023.
  • 3Lipton R J. DNA solution of hard computation problem. Science,1995, 268 (5210): 542-545.
  • 4Ouyang Q, Kaplan P D, Liu S M, et al. DNA solution of the maximal clique problem. Science, 1997, 278 (17) : 446-449.
  • 5Head T, Rozenberg G, Bladergroen R B, et al. Computing with DNA by operating on plasmids. Biosystems, 2000, 57 (2) : 87-93.
  • 6Sakamoto K, Gouzu H, Komiya K, et al. Molecular computation by DNA hairpin formation. Science, 2000, 288 (5) : 1223- 1226.
  • 7Liu Q H, Wang L M, Fruto A G, et al. DNA computing on surfaces. Nature, 2000, 403 (13) : 175- 179.
  • 8Wu H Y. An improved surface-based method for DNA computation. Biosystems, 2001, 59 (1): 1-5.
  • 9Forder S P, Read J L, Pirrung M C, et al. Light-Directed,spatially addreasable parallel chemical synthesis. Science, 1991,251 (4995): 767-773.
  • 10Bondy J A, Murty U S R. Graph Theory With Applications. New York: The Macmillan Press TD, 1976. 28-89.

共引文献15

同被引文献16

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部