Ibrahim, Zuwairie and Tsuboi, Yusei and Ono, Osamu and Khalid, Marzuki
(2004)
*Molecular computation approach to compete Dijkstra's algorithm.*
In:
2004 5th Asian Control Conference.
Institute of Electrical and Electronics Engineers, New York, pp. 635-642.
ISBN 0780388739

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1109/ASCC.2004.184830

## Abstract

Deoxyribonucleic Acid or DNA computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. In this paper, the potential of DNA computing to compete with Dijkstra's algorithm is investigated in detail that considers the computation of single source shortest path of a network or graph as a point of reference. The DNA-based computation is designed in such a way that every path is encoded by oligonucleotides and the path's length is directly proportional to the length of oligonucleotides. Using these properties, gel electrophoresis is performed in order to separate the respective DNA molecules according to their length. Thus, the shortest strands representing the shortest path could be extracted. We will describe in detail in this paper the overall biochemical laboratory procedures involved during the computation.

Item Type: | Book Section |
---|---|

Additional Information: | ISBN: 0780388739 2004 5th Asian Control Conference; 20-23 July 2004, Melbourne |

Uncontrolled Keywords: | algorithms, DNA, electrophoresis, graph theory, mathematical operators, set theory,bioinformatics, Dijkstra's algorithm, DNA computing, hamiltonian path problem (HPP), computational methods |

Subjects: | T Technology > TK Electrical engineering. Electronics Nuclear engineering |

Divisions: | Electrical Engineering |

ID Code: | 12129 |

Deposited By: | Liza Porijo |

Deposited On: | 12 Mar 2011 23:24 |

Last Modified: | 20 Jul 2011 09:57 |

Repository Staff Only: item control page