A polynomial-time DNA computing solution for the bin-packing problem

DOI10.1016/j.amc.2009.07.051zbMath1191.68309MaRDI QIDQ1039671

Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma

Publication date: 23 November 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.07.051

zbMATH Keywords

parallel algorithm; DNA computing; bin-packing problem

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68W10: Parallel algorithms in computer science

Related Items

Solving two-dimensional cutting stock problem via a DNA computing algorithm, A computational DNA solution approach for the quadratic Diophantine equation, A biological algorithm to solve the assignment problem based on DNA molecules computation, Spatial cluster analysis by the bin-packing problem and DNA computing technique, A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing

Cites Work

• Molecular solution to the 0-1 knapsack problem based on DNA computing
• A surface-based DNA algorithm for solving the binary knapsack problem
• A DNA-based graph encoding scheme with its applications to graph isomorphism problems
• A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
• Unnamed Item
• Unnamed Item
• Unnamed Item