A DNA procedure for solving the shortest path problem

DOI10.1016/J.AMC.2006.05.061MaRDI QIDQ864742zbMATH OpenOpenAlexFDO

Authors Zhaocai Wang, Dongmei Xiao, Wenxia Li, Lin He

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)

Recommendations

• Solving traveling salesman problem in the Adleman-Lipton model
• Closed circle DNA algorithm of shortest path problems
• A DNA algorithm for the maximal matching problem
• scientific article; zbMATH DE number 2087020
• scientific article; zbMATH DE number 1342106

Cites work

• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1342102 (Why is no real title available?)
• scientific article; zbMATH DE number 2087031 (Why is no real title available?)
• PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA
• PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES

Cited in

(12)

• scientific article; zbMATH DE number 2087020 (Why is no real title available?)
• A DNA algorithm for the maximal matching problem
• Making all spanning tree problem based on sticker model
• Clifford algebra method for network expression, computation, and algorithm construction
• scientific article; zbMATH DE number 1342106 (Why is no real title available?)
• The shortest kinship description problem
• A note on molecular computing algorithms for finding the shortest path with forbidden pairs
• Solving the maximum weighted clique problem based on parallel biological computing model
• Solving traveling salesman problem in the Adleman-Lipton model
• Computational and Information Science
• PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA
• Closed circle DNA algorithm of shortest path problems

This page was built for publication: A DNA procedure for solving the shortest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864742)