A DNA procedure for solving the shortest path problem

DOI10.1016/j.amc.2006.05.061zbMath1112.90090OpenAlexW2003715806MaRDI QIDQ864742

Wenxia Li, Lin He, Dongmei Xiao, Zhaocai Wang

Publication date: 13 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.061

zbMATH Keywords

DNA computingshortest path problemAdleman-Lipton modelNP-complete problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Protein sequences, DNA sequences (92D20)

Related Items

Solving the maximum weighted clique problem based on parallel biological computing model ⋮ Solving traveling salesman problem in the Adleman-Lipton model ⋮ Making all spanning tree problem based on sticker model ⋮ Clifford algebra method for network expression, computation, and algorithm construction

Cites Work

• PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES
• PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA
• Unnamed Item
• Unnamed Item
• Unnamed Item