DNA code word design for DNA computing with real-time polymerase chain reaction

Problem statement: A number of DNA computing models to solve mathematical graph problem such as the Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP), and the Shortest Path Problem (SPP), have been proposed and demonstrated. Normally, the DNA sequences used for the computation should...

Full description

Saved in:
Bibliographic Details
Main Authors: Ibrahim, Zuwairie, Mohamed Saaid, Muhammad Faiz, Khalid, Marzuki, Sarmin, Nor Haniza
Format: Article
Published: Science Publications 2009
Subjects:
Online Access:http://eprints.utm.my/id/eprint/13360/
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first