论文信息 - Solving traveling salesman problem in the Adleman-Lipton model

Solving traveling salesman problem in the Adleman-Lipton model

Abstract The traveling salesman problem is to find a minimum cost (weight) path for a given set of cities (vertices) and roads (edges). The path must start at a specified city and end there after going through all the other given cites only once. It is a classical NP-complete problem in graph theory. In this paper, we consider a DNA procedure for solving the traveling salesman problem in the Adleman–Lipton model. The procedure works in O ( n ) steps for the traveling salesman of an edge-weighted graph with n vertices.

Yiming Zhang | Zhaocai Wang | Haifeng Liu | Weihua Zhou

[1] Rainer Schuler,et al. DNA-based Parallel Computation of Simple Arithmetic , 2001, DNA.

[2] Lin He,et al. A DNA procedure for solving the shortest path problem , 2006, Appl. Math. Comput..

[3] F Guarnieri,et al. Maya Blue Paint: An Ancient Nanostructured Material , 1996, Science.

[4] Lin He,et al. DNA ternary addition , 2006, Appl. Math. Comput..

[5] Jiang Yu,et al. Procedures for a dynamical system on {0,1}n with DNA molecules. , 2006, Bio Systems.

[6] Akihiro Fujiwara,et al. Procedures for Computing the Maximum with DNA Strands , 2003, PDPTA.

[7] R J Lipton,et al. DNA solution of hard computational problems. , 1995, Science.

[8] L M Adleman,et al. Molecular computation of solutions to combinatorial problems. , 1994, Science.