AN ALGORITHM OF STICKER DNA CHIP MODEL ON MAKING SPANNING TREE PROBLEM

摘要：

In this paper, we set up sticker DNA chip model whose essential bio-chemical experiments and their realization of process are discussed. Then we put forward a DNA algorithm of making spanning tree problem and its bio-chemical implement process. The algorithm is first creating an original solution set of spanning subgraph then filtering the set to obtain all spanning trees. And then we prove the validity and complexity of the DNA algorithm, and explain feasibility of the DNA algorithm by an example. Finally, we can draw a conclusion that sticker DNA chip model possesses of predominance both of sticker model and DNA chip model.

关键词： A sticker DNA chip model making spanning tree problem memory complex marking experiment

作者: KANG ZHOU XIAO-JUN TONG JIN XU

作者单位: Department of Control Science and Engineer,Huazhong University of Science and Technology, Wuhan 4300 Department of Control Science and Engineer,Huazhong University of Science and Technology, Wuhan 4300

会议类型: 国际会议

会议名称: 2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

会议地点: 大连

会议语种:英文

页码: 4287-4292

在线出版日期: 2006-08-13（万方平台首次上网日期，不代表论文的发表时间）