Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem
DNA computing has emerged as an interdisciplinary field that draws together molecular biology, chemistry, computer science, and mathematics. The fundamental of this unconventional computation has been proven to solve weighted graph problems, such as the shortest path problem and the travelling sales...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Old City Publishing
2007
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/8767/1/ZuwairieIbrahim2007_ExperimentalImplementationofDirect.pdf http://eprints.utm.my/8767/ http://www.oldcitypublishing.com/IJUC/IJUC%203.1%20contents.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1845472074736336896 |
|---|---|
| author | Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu Khalid, Marzuki |
| author_facet | Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu Khalid, Marzuki |
| author_sort | Ibrahim, Zuwairie |
| building | UTM Library |
| collection | Institutional Repository |
| content_provider | Universiti Teknologi Malaysia |
| content_source | UTM Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | DNA computing has emerged as an interdisciplinary field that draws together molecular biology, chemistry, computer science, and mathematics. The fundamental of this unconventional computation has been proven to solve weighted graph problems, such as the shortest path problem and the travelling salesman problem. One of the fundamental improvements in DNA computing is direct-proportional length-based DNA computing for the shortest path problem. Generally, in DNA computing, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during computation. In this paper, a procedure to design the DNA sequences for the direct-proportional length-based DNA computing is presented. The procedure includes DNASequenceGenerator, a graph-based approach for designing a set of good DNA sequences |
| format | Article |
| id | my.utm.eprints-8767 |
| institution | Universiti Teknologi Malaysia |
| language | en |
| publishDate | 2007 |
| publisher | Old City Publishing |
| record_format | eprints |
| spelling | my.utm.eprints-87672010-06-02T01:57:49Z http://eprints.utm.my/8767/ Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu Khalid, Marzuki QA75 Electronic computers. Computer science DNA computing has emerged as an interdisciplinary field that draws together molecular biology, chemistry, computer science, and mathematics. The fundamental of this unconventional computation has been proven to solve weighted graph problems, such as the shortest path problem and the travelling salesman problem. One of the fundamental improvements in DNA computing is direct-proportional length-based DNA computing for the shortest path problem. Generally, in DNA computing, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during computation. In this paper, a procedure to design the DNA sequences for the direct-proportional length-based DNA computing is presented. The procedure includes DNASequenceGenerator, a graph-based approach for designing a set of good DNA sequences Old City Publishing 2007 Article PeerReviewed application/pdf en http://eprints.utm.my/8767/1/ZuwairieIbrahim2007_ExperimentalImplementationofDirect.pdf Ibrahim, Zuwairie and Tsuboi, Yusei and Ono, Osamu and Khalid, Marzuki (2007) Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem. International Journal of Unconventional Computing, 3 (1). pp. 15-34. ISSN 1548-7199 http://www.oldcitypublishing.com/IJUC/IJUC%203.1%20contents.html |
| spellingShingle | QA75 Electronic computers. Computer science Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu Khalid, Marzuki Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem |
| title | Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem
|
| title_full | Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem
|
| title_fullStr | Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem
|
| title_full_unstemmed | Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem
|
| title_short | Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem
|
| title_sort | experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem |
| topic | QA75 Electronic computers. Computer science |
| url | http://eprints.utm.my/8767/1/ZuwairieIbrahim2007_ExperimentalImplementationofDirect.pdf http://eprints.utm.my/8767/ http://www.oldcitypublishing.com/IJUC/IJUC%203.1%20contents.html |
| url_provider | http://eprints.utm.my/ |