THE MOLECULAR ALGORITHM OF CONNECTIVITY BASED ON THREE DIMENSIONAL DNA STRUCTURE  

作　　者：Fang Gang Zhang Shemin Zheng Anping Xu Jin 

机构地区：[1]Dept of Control Science and Eng., Huazhong Univ. of Sci. and Tech., Wuhan 430074, China [2]Informatics and Control Eng. Dept, Zhengzhou Univ. of Light Industry, Zhengzhou 450002, China

出　　处：《Journal of Electronics(China)》2007年第1期104-107,共4页电子科学学刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China (No.30370356 and No.60574041).

摘　　要：Inspired by the potential computational capability of 3-Dimensional (3D) DNA structure,this paper presents a graph structure constructed by k-armed (k = 3or 4) branched junction DNA molecules to explore the possibility of solving some intractable problems. 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 connec-tivity of this graph can be determined. Furthermore,the amount of potential solutions can be reduced by a theorem of graph theory.Inspired by the potential computational capability of 3-Dimensional （3D） DNA structure, this paper presents a graph structure constructed by k-armed （k = 3 or 4） branched junction DNA molecules to explore the possibility of solving some intractable problems. 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, the amount of potential solutions can be reduced by a theorem of graph theory.

关 键 词：3-Dimensional （3D） DNA structure CONNECTIVITY DNA computing 

分 类 号：O224[理学—运筹学与控制论] Q523.5[理学—数学]