电子学报2016，Vol.44Issue(7)：1561-1566,6.DOI:10.3969/j.issn.0372-2112.2016.07.006
DN A纳米颗粒共聚体在图的连通度问题中的应用
The Application of DNA/Nanoparticle Conjugate on the Graph’s Connectivity Proble m
摘要
Abstract
A DNA computing algorithm is proposed in this paper which uses the assembly process of DNA/Au nano-particle conjugate to solve an NP-complete problem in the Graph theory,the connectivity problem,and a 3 D DNA self-as-sembly algorithm model is also established.According to the algorithm,we need to design the special DNA/Au nanoparticle conjugate which will be based on a specific graph.Then,a series of experiments are performed to get the final answer and Visual DSD is used as the simulation in the paper,which will provide a practical way to the best use of DNA self-assembly algorithm model.关键词
DNA计算/DNA纳米金颗粒/图的连通度/三维模型Key words
DNA computing/DNA/Au nanoparticle/graph’s connectivity/3D model分类
信息技术与安全科学引用本文复制引用
王艳钗,张会,董亚非..DN A纳米颗粒共聚体在图的连通度问题中的应用[J].电子学报,2016,44(7):1561-1566,6.基金项目
国家自然科学基金（No．61272246）；陕西师范大学2013年勤助科研创新基金（No．QZZD13005）；陕西师范大学重点项目和陕西师范大学研究生培养创新基金 （）
