A DNA sequence design for molecular computation of HPP with output visualization based on real-time PCR

Molecular computing has proved its possibility to solve weighted graph problem such as Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP) and the Shortest Path Problem (SPP). Normally, in molecular computation, the DNA sequences used for the computation should be critically designed in...

Full description

Saved in:
Bibliographic Details
Main Authors: Ibrahim, Zuwairie, Kurniawan, Tri Basuki, Khalid, Marzuki
Format: Article
Published: 2008
Subjects:
Online Access:http://eprints.utm.my/id/eprint/9924/
http://dx.doi.org/10.1109/CEC.2007.4424694
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia

Similar Items