Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem

• Main Authors: Ibrahim, Zuwairie, Tsuboi, Yusei, Ono, Osamu, Khalid, Marzuki
• Format: Article
• Language: English
• Published: Old City Publishing 2007
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.utm.my/id/eprint/8767/1/ZuwairieIbrahim2007_ExperimentalImplementationofDirect.pdf; http://eprints.utm.my/id/eprint/8767/; http://www.oldcitypublishing.com/IJUC/IJUC%203.1%20contents.html

DNA computing has emerged as an interdisciplinary field that draws together molecular biology, chemistry, computer science, and mathematics. The fundamental of this unconventional computation has been proven to solve weighted graph problems, such as the shortest path problem and the travelling salesman problem. One of the fundamental improvements in DNA computing is direct-proportional length-based DNA computing for the shortest path problem. Generally, in DNA computing, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during computation. In this paper, a procedure to design the DNA sequences for the direct-proportional length-based DNA computing is presented. The procedure includes DNASequenceGenerator, a graph-based approach for designing a set of good DNA sequences