By Topic

0–1 Programming problem based on sticker model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lingying Zhi ; Dep t. of Mathematics and Physics, Anhui Univ. Of Science and Technology Huainan 232001, China ; Zhi-xiang Yin

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.

Published in:

Bio-Inspired Computing, 2009. BIC-TA '09. Fourth International Conference on

Date of Conference:

16-19 Oct. 2009