DNA Tile Assembly Model for Bin Packing Problem

Research results have confirmed that some reasonable solution for NP-complete problem could be achieved using DNA self-assembly model, in which the ability of molecular computing to perform complicated mathematical operations could be get a full play. In this paper, the DNA self-assembly model for the bin packing problem is constructed. This model is composed of two units: grouping based on binary method and subtraction system. The great advantage of our schema is that it only needs a constant number of DNA tile types and in time linear with the size of the items to solve any bin packing problem. This work demonstrates further evidence for the ability of DNA tiles to solve other NP-complete problems.