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-Packing Problem (BPP), that belongs to the class NP-Hard in the strong sense, in a time bounded by O(n2q), 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.