A DNA procedure for solving the shortest path problem

In this paper, we consider a procedure for solving the shortest path problem in the Adleman-Lipton model. The procedure works in O(n) steps for the shortest path problem of an edge-weighted graph with n vertices.