Universiti Teknologi Malaysia Institutional Repository

DNA implementation of k-shortest paths computation

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.

Full text not available from this repository.


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.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:DNA computing,
Subjects:Q Science > QH Natural history > QH301 Biology
ID Code:7185
Deposited By: Surayahani Abu Bakar
Deposited On:20 Jan 2009 07:59
Last Modified:28 Aug 2017 08:43

Repository Staff Only: item control page