scientific article; zbMATH DE number 2087016

MaRDI QIDQ4737646zbMATH OpenFDO

Authors Mario J. Pérez-Jiménez, Fernando Sancho Caparrini

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2340/23400161.htm

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Protein sequences, DNA sequences (92D20)

Recommendations

• A surface-based DNA algorithm for solving the binary knapsack problem
• Solve the partitioning problem by sticker model in DNA computing
• Molecular solution to the 0-1 knapsack problem based on DNA computing
• Knapsack problems based on three-stranded DNA structure model
• Using sticker to solve the 3-dimensional matching problem in molecular supercomputers

Cited in

(5)

• A polynomial-time DNA computing solution for the bin-packing problem
• Solve the partitioning problem by sticker model in DNA computing
• A computational DNA solution approach for the quadratic Diophantine equation
• Knapsack problems based on three-stranded DNA structure model
• Solving two-dimensional cutting stock problem via a DNA computing algorithm

This page was built for publication:

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