DNA implementation of k-shortest paths computation

Zuwairie Ibrahim, Yusei Tsuboi, Mohd Saufee Muhammad, Osamu Ono, Marzuki Khalid

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings
Pages707-713
Number of pages7
Publication statusPublished - 31 Oct 2005
Event2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005 - Edinburgh, Scotland, United Kingdom
Duration: 2 Sep 20055 Sep 2005

Publication series

Name2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings
Volume1

Conference

Conference2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005
CountryUnited Kingdom
CityEdinburgh, Scotland
Period2/09/055/09/05

    Fingerprint

Cite this

Ibrahim, Z., Tsuboi, Y., Muhammad, M. S., Ono, O., & Khalid, M. (2005). DNA implementation of k-shortest paths computation. In 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings (pp. 707-713). (2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings; Vol. 1).