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

被引：28

作者：

Alonso Sanches, Carlos Alberto

Soma, Nei Yoshihiro

机构：

[1] ITA, Computer Science Division

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2009年 / 215卷 / 06期

基金：

巴西圣保罗研究基金会;

关键词：

DNA computing; Bin-Packing Problem; Parallel algorithm; ADLEMAN-LIPTON MODEL; MOLECULAR COMPUTATION; KNAPSACK-PROBLEM; ALGORITHMS;

D O I：

10.1016/j.amc.2009.07.051

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：2055 / 2062

页数：8