摘要
利用DNA分子结构推得DNA计算机理及实现方式,提出用面上DNA计算模型求解最小集合覆盖问题,给出了具体应用和算法评价;在计算模板表面穷举了所有可能的结果,同一时间验证结果是否满足条件,实现DNA计算的强大并行性;同时在互补的寡聚核苷酸片段发生退火反应时,通过催化剂来决定是否杂交,减少人工参与、提高计算效率。最后,通过计算机仿真模拟验证了本模型的可行性。
Using the gotten DNA computing mechanism and realization through DNA molecular structure,this paper proposed a DNA solution on surface for minimal set covering problem,and presented specific applications and algorithm evaluation.It listed all possible results in the surface of the calculation template,which at the same time,verified whether the results met the conditions for the realization of the strong parallelism of DNA computing.Meanwhile,when complementary oligonucleotide gather nucleotide clips occured,it should be decided whether to hybridize through the catalyst,reducing human intervention and improving efficiency.Finally,computer simulations demonstrate the feasibility of the model.
出处
《计算机应用研究》
CSCD
北大核心
2012年第4期1220-1222,共3页
Application Research of Computers
基金
国家自然科学基金资助项目(61170038
60873058)
山东省自然科学基金资助项目(ZR2011FM001)
关键词
DNA计算
表面方式
最小集合覆盖问题
DNA computing
surface-based fashion
minimal set covering problem
