Cover Image

DNA implementation of k-shortest paths computation

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 generat...

Full description

Saved in:
Bibliographic Details
Main Authors: Ibrahim, Zuwairie, Tsuboi, Yusei, Muhammad, Mohd. Saufee, Ono, Osamu, Khalid, Marzuki
Format: Conference or Workshop Item
Published: 2005
Subjects:
QH301 Biology
Online Access:http://eprints.utm.my/id/eprint/7185/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.7185
record_format eprints
spelling my.utm.71852017-08-28T08:43:04Z http://eprints.utm.my/id/eprint/7185/ DNA implementation of k-shortest paths computation Ibrahim, Zuwairie Tsuboi, Yusei Muhammad, Mohd. Saufee Ono, Osamu Khalid, Marzuki QH301 Biology 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. 2005 Conference or Workshop Item PeerReviewed 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.
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QH301 Biology
spellingShingle QH301 Biology
Ibrahim, Zuwairie
Tsuboi, Yusei
Muhammad, Mohd. Saufee
Ono, Osamu
Khalid, Marzuki
DNA implementation of k-shortest paths computation
description 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.
format Conference or Workshop Item
author Ibrahim, Zuwairie
Tsuboi, Yusei
Muhammad, Mohd. Saufee
Ono, Osamu
Khalid, Marzuki
author_facet Ibrahim, Zuwairie
Tsuboi, Yusei
Muhammad, Mohd. Saufee
Ono, Osamu
Khalid, Marzuki
author_sort Ibrahim, Zuwairie
title DNA implementation of k-shortest paths computation
title_short DNA implementation of k-shortest paths computation
title_full DNA implementation of k-shortest paths computation
title_fullStr DNA implementation of k-shortest paths computation
title_full_unstemmed DNA implementation of k-shortest paths computation
title_sort dna implementation of k-shortest paths computation
publishDate 2005
url http://eprints.utm.my/id/eprint/7185/
_version_ 1643644718856273920
score 13.211869

Similar Items