Algorithm of DNA computing on optimal assignment problems

MaRDI QIDQ3614325zbMATH OpenFDO

Authors Kang Zhou, Jin Xu, Xiao-jun Tong

Publication date 6 March 2009

zbMATH Keywords

assignment problemchecking experimentDNA computingseparating experiment

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Protein sequences, DNA sequences (92D20)

Recommendations

• DNA computing-based algorithm for assignment problems
• A biological algorithm to solve the assignment problem based on DNA molecules computation
• scientific article; zbMATH DE number 1962032
• DNA computation for a special integer planning problem
• Algorithm of DNA computing of TSP

Cited in

(18)

• A polynomial-time DNA computing solution for the bin-packing problem
• Making all spanning tree problem based on sticker model
• A surface-based DNA algorithm for solving the binary knapsack problem
• A new DNA algorithm to solve graph coloring problem
• A computational DNA solution approach for the quadratic Diophantine equation
• A biological algorithm to solve the assignment problem based on DNA molecules computation
• Job shop scheduling problem based on DNA computing
• PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA
• scientific article; zbMATH DE number 5630435 (Why is no real title available?)
• scientific article; zbMATH DE number 1351098 (Why is no real title available?)
• scientific article; zbMATH DE number 1962032 (Why is no real title available?)
• A comment on ``Biological computation of the solution to the quadratic assignment problem
• DNA computing-based algorithm for assignment problems
• DNA computation for a special integer planning problem
• Algorithm of DNA computing of TSP
• Algorithms – ESA 2004
• Computational and Information Science
• New algorithms for some NP-optimization problems by DNA computing

This page was built for publication: Algorithm of DNA computing on optimal assignment problems

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