The Breadth First Search Traversing Algorithm of the Graphs in DNA Computer

摘要：

The design of a graph data structure, the memory structure and the breadth first search traversing algorithm are proposed. This algorithm can make the graph implement traversing in DNA computer. Finally, in order to prove the feasibility of the method, an actual example describes the implementing of the algorithm is given out. On the basis of the experimental theory of bio-molecular, the algorithm is an effective and feasible method.

关键词： DNA computer Graph Breadth_First Search Traversing

作者: Chunde YANG Guohui WEI Jun TAN Jingbo XIE

作者单位: Chongqing University of Posts and Telecommunications,cityChongQing,China Chongqing University of Posts and Telecommunications cityChongQing,China

会议类型: 国际会议

会议名称: The 3rd International Conference on Bioinformatics and Biomedical Engineering(iCBBE 2009)(第三届生物信息与生物医学工程国际会议)

会议地点: 北京

会议语种:英文

页码: 1-4

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