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

Carlos Alberto Alonso Sanches

doi:10.1016/j.amc.2009.07.051

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

2009-11-01

29

PRE

AI

C

Carlos Alberto Alonso Sanches

N

Nei Yoshihiro Soma

DOI：10.1016/j.amc.2009.07.051

Original

Original request for help

Save

Abstract

En 中文

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 N P-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. (C) 2009 Elsevier Inc. All rights reserved.

Keywords:

DNA computing

Bin-Packing Problem

Parallel algorithm

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

Abstract

Journal

Organization