| Biomolecular computing is computation at the molecular scale, using biotechnology engineering techniques. Over the post few years, some insightful researchers have bridged the gap between the biological computing and actual DNA-based computation。Recently, Many scientists in different fields are interest in DNA computing model based on reaction of biochemistry Because DNA computing has been formed a new science field. Many results have been obtained domestically in the research area of DNA computing. DNA computing is a novel method of solving a class of intractable computational problems, in which the computing speeds up exponentially with the problem size. Up to now, many accomplishments have been made to improve its performance andincrease its reliability.Sticker model, whose features are that it does not require DNA strands' extension, in the biological process, does not require biological enzyme action and is reusable of DNA strands, is one of the main models of DNA computing models, In this paper, utilizing these features of the model and its four basic operations (merger, separation, setting and clear), we try to solve the general 0-1 programming problem. The solution of DNA computing is put forward by YIN Zhi-xiang, thus we use the method learning from Professor Yin's idea described in this article to go on solving. |
