Fast parallel bio-molecular solutions: the set-basis problem
by Weng-Long Chang, Michael Ho, Minyi Guo, Chengfei Liu
International Journal of Computational Science and Engineering (IJCSE), Vol. 2, No. 1/2, 2006

Abstract: In the paper, it is demonstrated how to apply sticker in the sticker-based model for constructing solution space of DNA for the set-basis problem and how to apply DNA operations in the Adleman-Lipton model to solve that problem from solution space of sticker. Furthermore, this work shows the ability of DNA-based computing for resolving the NP-complete problems.

Online publication date: Sat, 03-Jun-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com