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