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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Electrical Engineering
2008
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/9927/1/ZuwairieIbrahim2008_ADNASequenceDesignForMplecularComputation.pdf http://eprints.utm.my/id/eprint/9927/ http://www.fke.utm.my/elektrika/dec08/paper10dec08.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |
| Language: | English |
| Summary: | 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 |
|---|