Universiti Teknologi Malaysia Institutional Repository

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

Ibrahim, Zuwairie and Tsuboi, Yusei and Ono, Osamu and Khalid, Marzuki (2007) Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem. International Journal of Unconventional Computing, 3 (1). pp. 15-34. ISSN 1548-7199

[img] PDF
Restricted to Repository staff only

366Kb

Official URL: http://www.oldcitypublishing.com/IJUC/IJUC%203.1%2...

Abstract

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

Item Type:Article
Uncontrolled Keywords:DNA computing, DNA sequence generator, sequence design, the shortest path problem
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computer Science and Information System (Formerly known)
ID Code:8767
Deposited By:INVALID USER
Deposited On:12 May 2009 08:39
Last Modified:02 Jun 2010 01:57

Repository Staff Only: item control page