关键词: 进化算法, 三维DNA结构, 连通度, DNA计算

Abstract: To determine the connectivity of a 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 our 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.

Key words: Evolutionary Algorithm, 3-Dimensional DNA structure, Connectivity, DNA computing