全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
电子学报  2013 

基于自组装的N皇后问题DNA计算算法

DOI: 10.3969/j.issn.0372-2112.2013.11.010, PP. 2174-2180

Keywords: DNA计算,自组装模型,N皇后问题,tile模型

Full-Text   Cite this paper   Add to My Lib

Abstract:

N皇后问题是理论计算机科学中一个经典的NP难问题.自Adleman首次运用DNA计算来解决NP问题以来,DNA计算已成为计算机科学的研究热点之一,现有N皇后问题的DNA计算机算法多基于粘贴和剪接模型,存在生化操作复杂度和实验误差较高等问题.本文提出了一种基于DNA自组装模型来求解N皇后问题的DNA计算方法.算法通过减少实验操作步骤数,降低了生化解的错误率.算法使用的tiles分子块种类为O(n2),生化操作复杂性为O(1),其中n为皇后的个数.与求解N皇后问题的其它DNA算法的对比分析表明,本算法可提高生化解的准确性,降低算法生化实验的复杂度,具有良好的易操作性.

References

[1]  Wang H.Dominoes and the AEA case of the decision problem[A].Proceedings of the Symposium in the Mathematical Theory of Automata.Brooklyn[C].New York:Polytechnic Press,1963.23-55
[2]  许进,谭刚军,范月科,等.DNA计算机原理、进展及难点(Ⅳ):论DNA计算机模型[J].计算机学报,2007,30(6):881-893. Xu Jin,Tan Gang-Jun,Fan Yue-Ke,et al.DNA computer pinciple,advances and difficulties (Ⅳ):On the models of DNA computer[J].Chinese Journal of Computers,2007,30(6):881-893.(in Chinese)
[3]  范月科,强小利,许进.图的最大团与最大独立集粘贴DNA计算模型[J].计算机学报,2010,33(2):305-310. Fan Yue-Ke,Qiang Xiao-li,Xu Jin.Sticker model for maximum clique problem and maximum independent set[J].Chinese Journal of Computers,,2010,33(2):305-310.(in Chinese)
[4]  周旭,李肯立,乐光学,杨志邦.一种基于分治的三维匹配问题DNA计算算法[J].电子学报,2010,38(8):1831-1836. Zhou Xu,Li Ken-li,Yue Guang-xue et al.A new DNA computing''s algorithm for 3-dimensional matching problem based on divide and conquer strategy[J].Acta Electronica Sinica,2010,38(8):1831-1836.(in Chinese)
[5]  Xiaojun Ma,Lombardi,F.,Synthesis of tile sets for DNA self-assembly[J].Computer-Aided Design of Integrated Circuits and Systems,IEEE Transactions on,2008,27(5):963-967.
[6]  Seeman N C.DNA nanotechnology:Novel DNA constructions[J].Annual Review of Biophysics and Biomolecular Structure,1998,27:225-248.
[7]  He Yu,Mao Cheng-De et al.Hierarchical self-assembly of DNA into symmetric supramolecular polyhedral[J].Nature,2008,452:198- 202.
[8]  杨静,张成.DNA自组装技术的研究进展及难点[J].计算机学报,2008,31(12):2138-2148. Yang Jing,Zhang Cheng.Progress and difficulty in DNA self-assembly technology.Chinese Journal of Computers,2008,31(12):2138-2148.(in Chinese)
[9]  Bell J,Stevens B.A survey of known results and research areas for N-Queens[J].Discret.Math.2009,309(1):1-31.
[10]  Tsu-Ju Fu,Nadrian C.Seeman.DNA double- crossover molecules[J].Biochemistry,1993,32:3211-3220.
[11]  Brun Y.Solving NP-complete problems in the tile assembly model[J].Theoretical Computer Science,2008,395(1):31-46.
[12]  Winfree E.Algorithmic Self-Assembly of DNA[D].California Institute of Technology.Pasadena,California,1998.
[13]  E Winfree,The xgrow simulator[EB/OL].http://dna.caltech.edu/Xgrow/,2009.
[14]  殷志祥,崔建中,支凌迎,等.可满足问题的分子信标计算模型[J].计算机学报,2008,31(12):2200-2206. Yin Zhi-Xiang,Cui Jian-Zhong,et al.Molecular beacon based DNA computing model for general satisfiability problem[J].Chinese Journal of Computers,,2008,31(12):2200-2206.(in Chinese)
[15]  S.Garcia,A.Orailoglu.Making DNA self-assembly error-proof:Attaining small growth error rates through embedded information redundancy[A].Design,Automation & Test in Europe Conference & Exhibition,2009.DATE''09[C].Nice,2009.898-901.
[16]  Adleman L M.Molecular computation of solutions to combinatorial problems[J].Science,1994,266(11):1021-1023.
[17]  刘文斌,朱翔欧,王向红,等.DNA计算的研究进展[J].电子学报,2006,34(11):2053-2057. Liu Wen-bin,Zhu Xiang-ou,Wang Xiang-hong et al.Progress in the research of DNA computing[J].Acta Electronica Sinica,2006,34(11):2053-2057.(in Chinese)
[18]  Winfree Erik et al.Design and self-assembly of two-dimensional DNA crystals.Nature,1998,394:539-544.
[19]  Jonoska N,Karl S A,Saito M.Three dimensional DNA structures in computing[J].Biosystems,1999,52:143-153.
[20]  高琳,许进,张军英.DNA计算的研究进展与展望[J].电子学报,2001,29(7):973-977. Gao Lin,Xu Jin,et al.A survey of DNA computing[J].Acta Electronica Sinica,2001,29(7):973-977.(in Chinese)
[21]  H Ahrabian,A Merzaei,A Nowzari-Dalini.A DNA sticker algorithm for solving N-queen problem[J].International Journal for Computer Science and Applications,2008,5(2):12-22.
[22]  马润年,张强,高琳,许进.图的最大权团的DNA计算[J].电子学报,2004,32(1):13-16. Ma Run-nian,Zhang Qiang,et al.Using DNA to solve the maximum weight clique of graphs[J].Acta Electronica Sinica,2004,32(1):13-16.(in Chinese)
[23]  Yuriy Brun,Efficient 3-SAT algorithms in the tile assembly model[J].Natural Computing,2011,11(2):209-229.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133