Implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly
In this paper, an in vitro implementation of DNA computing for finding k-shortest paths of a weighted graph is reported. After the initial solution is subjected to amplification by polymerase chain reaction, k-shortest paths are visualized by polyacrylamide gel electrophoresis and the selection can...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
ICIC International
2006
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/9164/ |
| _version_ | 1848891824083566592 |
|---|---|
| author | Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu |
| author_facet | Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu |
| author_sort | Ibrahim, Zuwairie |
| building | UTeM Institutional Repository |
| collection | Online Access |
| description | In this paper, an in vitro implementation of DNA computing for finding k-shortest paths of a weighted graph is reported. After the initial solution is subjected to amplification by polymerase chain reaction, k-shortest paths are visualized by polyacrylamide gel electrophoresis and the selection can be done. For initial pool generation, hybridization-ligation and parallel overlap assembly are employed and compared. The experimental results show the effectiveness of the proposed in vitro computation, where both initial pool generation methods are able to generate the initial pool candidates for the k-shortest paths computation on a DNA computer. However, parallel overlap assembly is more preferable than that of hybridization-ligation in terms of population size and generation time. |
| first_indexed | 2025-11-15T21:04:06Z |
| format | Article |
| id | utm-9164 |
| institution | Universiti Teknologi Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T21:04:06Z |
| publishDate | 2006 |
| publisher | ICIC International |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | utm-91642018-11-29T07:34:38Z http://eprints.utm.my/9164/ Implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu TK Electrical engineering. Electronics Nuclear engineering In this paper, an in vitro implementation of DNA computing for finding k-shortest paths of a weighted graph is reported. After the initial solution is subjected to amplification by polymerase chain reaction, k-shortest paths are visualized by polyacrylamide gel electrophoresis and the selection can be done. For initial pool generation, hybridization-ligation and parallel overlap assembly are employed and compared. The experimental results show the effectiveness of the proposed in vitro computation, where both initial pool generation methods are able to generate the initial pool candidates for the k-shortest paths computation on a DNA computer. However, parallel overlap assembly is more preferable than that of hybridization-ligation in terms of population size and generation time. ICIC International 2006 Article PeerReviewed Ibrahim, Zuwairie and Tsuboi, Yusei and Ono, Osamu (2006) Implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly. International Journal of Innovative Computing Information and Control, 2 (1). pp. 265-271. ISSN 1349-4198 http://www.ijicic.org/fic04-09-1.pdf |
| spellingShingle | TK Electrical engineering. Electronics Nuclear engineering Ibrahim, Zuwairie Tsuboi, Yusei Ono, Osamu Implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly |
| title | Implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly |
| title_full | Implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly |
| title_fullStr | Implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly |
| title_full_unstemmed | Implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly |
| title_short | Implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly |
| title_sort | implementation of k-shortest paths computation on a molecular computer via hybridization-ligation and parallel overlap assembly |
| topic | TK Electrical engineering. Electronics Nuclear engineering |
| url | http://eprints.utm.my/9164/ http://eprints.utm.my/9164/ |