0–1 Programming problem based on sticker model

Sticker model is one of the main DNA computing models, whose features are that it does not require extension of DNA strands in the biological process, does not require biological enzyme action and also the DNA strands can be reused In this paper, we try to solve the general 0-1 programming problem by utilizing these features of the model and its four basic operations (merger, separation, setting and clear). The solution of DNA computing is put forward in [6] and [7], thus we use the method learning from [7]´s idea described in this article to go on solving.