Algorithm of DNA computing of TSP

MaRDI QIDQ5453147zbMATH OpenFDO

Authors Kang Zhou, Wen Bin Liu, Jin Xu

Publication date 4 April 2008

zbMATH Keywords

biochemistry experimentDNA computingoptimization algorithmtraveling salesman problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Protein sequences, DNA sequences (92D20)

Recommendations

• Closed circle DNA algorithm of shortest path problems
• Algorithm of DNA computing on optimal assignment problems
• DNA algorithm for solution to Hamilton cycle problem
• Solving traveling salesman problem in the Adleman-Lipton model
• scientific article; zbMATH DE number 1342106

Cited in

(6)

• Solving traveling salesman problem in the Adleman-Lipton model
• Algorithm of DNA computing on optimal assignment problems
• Generating DNA code word for DNA computing with real time PCR
• scientific article; zbMATH DE number 1953208 (Why is no real title available?)
• Closed circle DNA algorithm of shortest path problems
• New algorithms for some NP-optimization problems by DNA computing

This page was built for publication: Algorithm of DNA computing of TSP

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