Depth_first Search Traversing Algorithm of Graphs in DNA Computer
Jun Tan
Abstract
Jun Tan
Abstract
The design of a graph data structure,the memory structure and the depth_first search traversing algorithm are proposed.This algorithm can make the graph implement traversing in DNA computer.In order to prove the feasibility of the method,an actual example is given out,which describes the implementation of the algorithm.On the basis of the experimental theory of bio-molecular,the algorithm is an effective and feasible method.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The design of a graph data structure,the memory structure and the depth_first search traversing algorithm are proposed.This algorithm can make the graph implement traversing in DNA computer.In order to prove the feasibility of the method,an actual example is given out,which describes the implementation of the algorithm.On the basis of the experimental theory of bio-molecular,the algorithm is an effective and feasible method.
Key concepts: Traverse, Computer science, Algorithm, Basis (linear algebra), Graph, Search algorithm, Breadth-first search, Graph traversal