Application of DNA computing by self-assembly on 0-1 knapsack problem

Abstract

Computation by self-assembly of DNA is an efficient method of executing parallel DNA computing where information is encoded in DNA tiles and a large number of tiles can be self-assembled via sticky-end associations. It presents clear evidence of the ability of molecular computing to perform complicated mathematical operations. We investigate how basic ideas on tiling can be applied to solving knapsack problem. It suggests that these procedures can be realized on the molecular scale through the medium of self-assembled DNA tiles. The potential of DNA computing by self-assembly for the knapsack problem is promising given the operational time complexity of Θ(n). © 2009 Springer Berlin Heidelberg.