Sticker DNA computer model--PartⅡ:Application
Sticker model is one of the basic models in the DNA computer models. This model is coded with single-double stranded DNA molecules. It has the following advantages that the operations require no strands extension and use no enzymes; What's more, the materials are reusable. Therefore, it arouses attention and interest of scientists in many fields. In this paper, we extend and improve the sticker model, which will be definitely beneficial to the construction of DNA computer. This paper is the second part of our series paper, which mainly focuses on the application of sticker model. It mainly consists of the following three sections: the matrix representation of sticker model is first presented; then a brief review of the past research on graph and combinatorial optimization, such as the minimal set covering problem, the vertex covering problem, Hamiltonian path or cycle problem, the maximal clique problem, the maximal independent problem and the Steiner spanning tree problem, is described; Finally a DNA algorithm for the graph isomorphic problem based on the sticker model is given.
作 者： XU Jin LI Sanping DONG Yafei Wei Xiaopeng 作者单位： XU Jin,DONG Yafei(Institute of Molecule Computing, Department of Control Science and Engineering, Huazhong University, Wuhan 430074, China)LI Sanping(College of Mathematics and Information, Shanxi Normal University, Xi'an 710062, China)
Wei Xiaopeng(Mode Advanced Design Technology Centre, Dalian University, Dalian 116622, China)
刊 名： 科学通报(英文版) SCI 英文刊名： CHINESE SCIENCE BULLETIN 年，卷(期)： 2004 49(9) 分类号： Q3 关键词： DNA computing sticker model k-bit sticker model combinatorial optimization problem