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

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

It is already been proven that it is possible to solve mathematical graph problem such as the Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP), and the Shortest Path Problem (SPP), by means of molecular computing. Normally, in molecular computation, the DNA sequences used for the com...

Full description

Saved in:
Bibliographic Details
Main Authors: Ibrahim, Zuwairie, Kurniawan, Tri Basuki, Sarmin, Nor Haniza, Khalid, Marzuki
Format: Article
Language:English
Published: Faculty of Electrical Engineering 2008
Subjects:
TK Electrical engineering. Electronics Nuclear engineering
Online Access:http://eprints.utm.my/id/eprint/9927/1/ZuwairieIbrahim2008_ADNASequenceDesignForMplecularComputation.pdf
http://eprints.utm.my/id/eprint/9927/
http://www.fke.utm.my/elektrika/dec08/paper10dec08.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia
Language: English

Internet

http://eprints.utm.my/id/eprint/9927/1/ZuwairieIbrahim2008_ADNASequenceDesignForMplecularComputation.pdf
http://eprints.utm.my/id/eprint/9927/
http://www.fke.utm.my/elektrika/dec08/paper10dec08.pdf

Similar Items