DNA computing-based algorithm for assignment problems

MaRDI QIDQ5319462zbMATH OpenFDO

Authors Kang Zhou, Jin Xu, Xiao-jun Tong

Publication date 22 July 2009

zbMATH Keywords

assignment problemsclosed circle DNA computing modelgroup insert experiment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Protein sequences, DNA sequences (92D20)

Recommendations

• Algorithm of DNA computing on optimal 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
• Closed circle DNA algorithm of shortest path problems

Cited in

(14)

• A polynomial-time DNA computing solution for the bin-packing problem
• 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
• scientific article; zbMATH DE number 5510507 (Why is no real title available?)
• Algorithm of DNA computing on optimal assignment problems
• scientific article; zbMATH DE number 5630435 (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
• scientific article; zbMATH DE number 1738649 (Why is no real title available?)
• DNA computation for a special integer planning problem
• Closed circle DNA algorithm of shortest path problems
• New algorithms for some NP-optimization problems by DNA computing

This page was built for publication: DNA computing-based algorithm for assignment problems

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