AAM  >> Vol. 3 No. 1 (February 2014)

    用分子信标作为粘贴串的DNA计算模型的逻辑门
    Using Molecular Beacons as Paste Series Computing Model of a Logic Gate

  • 全文下载: PDF(250KB) HTML    PP.29-34   DOI: 10.12677/AAM.2014.31005  
  • 下载量: 1,355  浏览量: 5,580   国家自然科学基金支持

作者:  

唐静静,单静怡:安徽理工大学理学院,淮南

关键词:
DNA粘贴模型分子信标逻辑门DNA计算DNA Sticker Model; Molecular Beacon; Logic Gate; DNA Computing

摘要:

近年来,随着DNA计算及DNA计算机研究的发展,运用粘贴模型和粘贴系统来实现布尔逻辑门已经成为DNA计算机研究的热点。而把分子信标作为粘贴串的一份子还未曾见到过,此篇论文用这样一种新的方法来实现逻辑门的DNA计算模型。该模型同时拥有以往普通粘贴模型的优点。它更易于操作和观察,使结果有更强的可靠性。由于分子信标本身所具有的高特异性和高灵敏度,逻辑门有了更直观的操作和检测。

In recent years, it has become a research focus of DNA computer to realize the Boolean logic gates by using DNA sticker model and paste system, with the research of DNA computing and DNA computer going on. But making the molecular beacon as part of the paste series has not been seen, and this paper realizes the DNA computing model of logic gates with such a new method. This model has all the advantages that the previous general sticker model has. Also it is easier to operate and observe, and has higher reliability of results. With high specificity and sensitivity of molecular beacon itself, the logic gate has a more intuitive operation and observation.

文章引用:
唐静静, 单静怡. 用分子信标作为粘贴串的DNA计算模型的逻辑门[J]. 应用数学进展, 2014, 3(1): 29-34. http://dx.doi.org/10.12677/AAM.2014.31005

参考文献

[1] 黄布毅, 许进 (2005) DNA计算中若干理论问题的研究. 硕士学位论文, 华中科技大学, 武汉.
[2] Adleman, L., et al. (1994) Molecular computations to combinatorial problems. Science, 266, 1021-1024.
[3] 刘文斌, 朱翔鸥, 王向红, 陈丽春 (2006) DNA计算的研究进展. 电子学报, 11, 2053-2057.
[4] Liu, W.B., et al. (2004) A new DNA computing model for the NAND gate based on induced hairpin formation. BioSystems, 77, 87-92.
[5] Hwang, K. (1991) Advanced computer architecture. McGraw Hill, New York.
[6] 高琳, 马润年, 许进 (2002) 基于质粒DNA匹配问题的分子算法. 生物化学与生物物理进展, 5, 820-822.
[7] 张连珍, 许进 (2004) 基于质粒的DNA计算模型研究. 计算机工程与应用, 4, 51-52.
[8] Cukras, A., Faulhammer, D., Lipton, R., et al. (1998) Chess games: A model for RNA-based computation. Biosystems, 52, 35-45..
[9] Liu, Q.H., Guo, Z., Condon, A.E., et al. (1998) A surface-based approach to DNA computation. Proceedings of the 2nd Annual Meeting on DNA Based Computers, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, Journal of Computational Biology, 5, 255-267.
[10] Liu, Q.H., Guo, Z., Condon, A.E., et al. (2000) DNA computing on surfaces. Nature, 403, 175-179.
[11] Liu, Q., Frutos, A., Wang, L., et al. (1999) Progress towards demonstration of a surface based DNA computation: A one word approach to solve a model satiability problem. Biosystems, 52, 25-33.
[12] Takahara, A. (2002) On the computational power of insertion-deletion systems. Proceedings of 8th International Meeting on DNA Based Computers, Sapporo, 10-13 June 2002, 139-150.
[13] 许进, 董亚非 (2003) 粘贴DNA计算模型理论及应用. 科学通报, 12, 205-212, 299-307.
[14] Liu, W.B., Wang, S.D. and Xu, J. (2003) Solving the 3-SAT Problem Based on DNA Computing. Journal of Chemical Information and Com- puter Sciences, 43, 1872-1875.
[15] Nishikawa, A., Hagiya, M. and Yamamura, M. (1999) Virtual DNA simulator and protocol design by GA. Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, 13-17 July 1999, 1810-1816.