Title :
The Breadth First Search Traversing Algorithm of the Graphs in DNA Computer
Author :
Yang, Chunde ; Wei, Guohui ; Tan, Jun ; Xie, Jingbo
Author_Institution :
Chongqing Univ. of Posts & Telecommun., Chongqing, China
Abstract :
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.
Keywords :
biocomputing; tree data structures; tree searching; DNA computer; bio-molecular theory; breadth first search traversing algorithm; graph data structure design; memory structure; Algorithm design and analysis; Biological system modeling; Biology computing; DNA computing; Data processing; Data structures; Diseases; Image storage; Parallel processing; Telecommunication computing;
Conference_Titel :
Bioinformatics and Biomedical Engineering , 2009. ICBBE 2009. 3rd International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-2901-1
Electronic_ISBN :
978-1-4244-2902-8
DOI :
10.1109/ICBBE.2009.5163581
