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...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , |
|---|---|
| Format: | Artikel |
| Diterbitkan: |
2008
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/9924/ http://eprints.utm.my/9924/ |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|