摘要
针对求连通度这一难解问题,提出了三维DNA图结构进化算法。并提出了一种由k-臂DNA分子构建的图结构。在所述方法中3、4臂DNA分子的顶点构造块被选择性地用来构建一些不同的图结构。然后通过凝胶电泳分离,图的连通度便可确定。并且通过引入进化算法的思想,避免了解空间的穷举。
To determine the connectivity of graph,a three dimensional DNA graph structure and the detailed procedures of the algorithm are presented.In this paper,we propose a graph structure constructed by k-armed（k=3 or 4） branched junction DNA molecules.In the proposed procedure,vertex building blocks consisting of 3,4-armed branched junction molecules are selectively used to form different graph structures.After separating these graph structures by gel electrophoresis,the connectivity of this graph can be determined.Furthermore,based on evolutionary algorithm enumerating all the potential solutions is avoided.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第7期41-44,共4页
Computer Engineering and Applications
基金
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60533010)
陕西省教育厅科学研究计划(the Foun-dation of Department of Education of Shaanxi Province of China under Grant No.06JK202)
关键词
三维DNA结构
连通度
DNA计算
进化算法
3-dimensional DNA structure
connectivity
DNA computing
evolutionary algorithm
