A Dna Sequence Approach of Direct-Proportional Length-Based Dna Computing By Dna Sequence Generator

Approaching DNA sequences for direct-proportional length-based DNA computing

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 approached in order to reduce error that could occur during computation. In this paper, a procedure to approach the DNA sequences for the direct-proportional length-based DNA computing is presented. The procedure includes DNA Sequence Generator, a graph-based approach for approaching a set of good DNA sequences.