A polynomial-time DNA computing solution for the Bin-Packing Problem

It is suggested here an algorithm based on stickers for the DNA Computing model [S. Roweis, E. Winfree, R. Burgoyne, N. Chelyapov, M. Goodman, P. Rothemund, L. Adleman, A sticker-based model for DNA Computation, Journal of Computational Biology 5 (1998) 615–629] that solves the well known Bin-Packin...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 215; no. 6; pp. 2055 - 2062
Main Authors Alonso Sanches, Carlos Alberto, Soma, Nei Yoshihiro
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier Inc 15.11.2009
Elsevier
Subjects
Bin-Packing Problem
DNA computing
Exact sciences and technology
Mathematical analysis
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Parallel algorithm
Sciences and techniques of general use
Bin-Packing Problem
Parallel algorithm
DNA computing
Numerical analysis
Applied mathematics
DNA
Algorithmics
Bin packing problem
Polynomial time
Online AccessGet full text

Cover

More Information
Summary:It is suggested here an algorithm based on stickers for the DNA Computing model [S. Roweis, E. Winfree, R. Burgoyne, N. Chelyapov, M. Goodman, P. Rothemund, L. Adleman, A sticker-based model for DNA Computation, Journal of Computational Biology 5 (1998) 615–629] that solves the well known Bin-Packing Problem (BPP), that belongs to the class NP -Hard in the strong sense, in a time bounded by O ( n 2 q ) , where n is the quantity of items and q the space requirements expressed in bits. To the best of the authors’ knowledge, this is the first polynomial time algorithmic solution for the BPP in such a model.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2009.07.051