DNA implementation of k-shortest paths computation
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonucleotides and the length of the path is directly proportional to the length of oligonucleotides. For initial pool generat...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/7185/ |
| _version_ | 1848891418708279296 |
|---|---|
| author | Ibrahim, Zuwairie Tsuboi, Yusei Muhammad, Mohd. Saufee Ono, Osamu Khalid, Marzuki |
| author_facet | Ibrahim, Zuwairie Tsuboi, Yusei Muhammad, Mohd. Saufee Ono, Osamu Khalid, Marzuki |
| author_sort | Ibrahim, Zuwairie |
| building | UTeM Institutional Repository |
| collection | Online Access |
| description | In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonucleotides and the length of the path is directly proportional to the length of oligonucleotides. For initial pool generation, parallel overlap assembly is employed for efficient generation of all candidate answers. During the computation, after the initial pool of solution is subjected to amplification, which is polymerase chain reaction, k shortest paths could be separated by gel electrophoresis and the selection can be made at last. |
| first_indexed | 2025-11-15T20:57:39Z |
| format | Conference or Workshop Item |
| id | utm-7185 |
| institution | Universiti Teknologi Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T20:57:39Z |
| publishDate | 2005 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | utm-71852017-08-28T08:43:04Z http://eprints.utm.my/7185/ DNA implementation of k-shortest paths computation Ibrahim, Zuwairie Tsuboi, Yusei Muhammad, Mohd. Saufee Ono, Osamu Khalid, Marzuki QH301 Biology In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonucleotides and the length of the path is directly proportional to the length of oligonucleotides. For initial pool generation, parallel overlap assembly is employed for efficient generation of all candidate answers. During the computation, after the initial pool of solution is subjected to amplification, which is polymerase chain reaction, k shortest paths could be separated by gel electrophoresis and the selection can be made at last. 2005 Conference or Workshop Item PeerReviewed Ibrahim, Zuwairie and Tsuboi, Yusei and Muhammad, Mohd. Saufee and Ono, Osamu and Khalid, Marzuki (2005) DNA implementation of k-shortest paths computation. In: IEEE Congress on Evolutionary Computation, IEEE CEC 2005, 2005, Kanagawa,Japan. |
| spellingShingle | QH301 Biology Ibrahim, Zuwairie Tsuboi, Yusei Muhammad, Mohd. Saufee Ono, Osamu Khalid, Marzuki DNA implementation of k-shortest paths computation |
| title | DNA implementation of k-shortest paths computation |
| title_full | DNA implementation of k-shortest paths computation |
| title_fullStr | DNA implementation of k-shortest paths computation |
| title_full_unstemmed | DNA implementation of k-shortest paths computation |
| title_short | DNA implementation of k-shortest paths computation |
| title_sort | dna implementation of k-shortest paths computation |
| topic | QH301 Biology |
| url | http://eprints.utm.my/7185/ |