Ibrahim, Zuwairie and Kurniawan, Tri Basuki and Khalid, Marzuki (2008) A DNA sequence design for molecular computation of HPP with output visualization based on real-time PCR. 2007 IEEE Congress on Evolutionary Computation, CEC 2007, 1-10 . pp. 1823-1828. ISSN 0128-4428
Full text not available from this repository.
Official URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=1...
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 computation should be critically designed in order to reduce error that could occur during computation. In the previous paper, we have proposed a new readout method tailored specifically to HPP in DNA computing using real-time PCR for output visualization. Six nodes HPP was considered. Based on the example instance, the method requires 11 oligonucleotides, where 6 oligonucleotides are for the nodes and 5 oligonucleotides are for the edges. Three TaqMan probes and five primers are required as well. In this study, a procedure for DNA sequence design is presented in order to obtain good sequences for those nodes, primers, and probes. The experiment is done based on the generated DNA sequences and the Hamiltonian Path can be determined successfully
|Uncontrolled Keywords:||DNA Sequence Design, Hamiltonian Path Problem, Molecular Computation, Visualization, Real-Time PCR|
|Subjects:||T Technology > T Technology (General)|
T Technology > TK Electrical engineering. Electronics Nuclear engineering
|Deposited By:||Siti Najwa Hanim Kamarulzaman|
|Deposited On:||22 Jun 2010 04:21|
|Last Modified:||22 Jun 2010 04:21|
Repository Staff Only: item control page