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...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , , |
|---|---|
| Format: | Artikel |
| Bahasa: | English |
| Diterbitkan: |
Faculty of Electrical Engineering
2008
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/9927/ http://eprints.utm.my/9927/ http://eprints.utm.my/9927/1/ZuwairieIbrahim2008_ADNASequenceDesignForMplecularComputation.pdf |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!