A DNA procedure for solving the shortest path problem

作者：

Highlights：

•

摘要

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.

论文关键词：The shortest path problem,NP-complete problem,Adleman–Lipton model,DNA computing

论文评审过程：Available online 24 July 2006.

论文官网地址：https://doi.org/10.1016/j.amc.2006.05.061