Ibrahim, Zuwairie and Tsuboi, Yusei and Ono, Osamu and Khalid, Marzuki (2004) Molecular computation approach to compete dijkstraâ€™s algorithm. In: 5th Asian Control Conference , Kanagawa,Japan.
Full text not available from this repository.
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:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||DNA,dijkstraâ€™s algorithm,molecular computation|
|Subjects:||Q Science > QH Natural history > QH301 Biology|
|Deposited By:||Surayahani Abu Bakar|
|Deposited On:||20 Jan 2009 07:45|
|Last Modified:||20 Jan 2009 07:45|
Repository Staff Only: item control page