New algorithms for some NP-optimization problems by DNA computing

zbMATH Open1084.68541MaRDI QIDQ815653FDOQ815653

Authors: Huiqin Qu, Hong Zhu, Chao Peng 

Publication date: 17 February 2006

Published in: Progress in Natural Science (Search for Journal in Brave)

Recommendations

• Algorithm of DNA computing on optimal assignment problems
• DNA models and algorithms for NP-complete problems
• DNA computing-based algorithm for assignment problems
• DNA computation for a special integer planning problem
• scientific article; zbMATH DE number 1962032
• scientific article; zbMATH DE number 2089972
• Algorithm of DNA computing of TSP
• A new DNA algorithm to solve graph coloring problem
• A polynomial-time DNA computing solution for the bin-packing problem
• scientific article; zbMATH DE number 1241364

zbMATH Keywords

algorithmsDNA computingNP-optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (9)

• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• A computational DNA solution approach for the quadratic Diophantine equation
• Genetic code-based DNA computation for the Hamiltonian path problem
• A polynomial-time DNA computing solution for the bin-packing problem
• A new DNA algorithm to solve graph coloring problem
• The computing model for minimal covering problem based on three-dimensional DNA walker
• Title not available (Why is that?)
• A note on molecular computing algorithms for finding the shortest path with forbidden pairs
• Computational and Information Science

This page was built for publication: New algorithms for some NP-optimization problems by DNA computing

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