| Summary: | DNA computing has emerged as an interdiciplinary field that draws together moleculer biology, chemistry, computer science, and mathematics. This unconventional computation has been proven to solve weighted graph problem such as the shortest path problem and the traveling salesman problem. One of the fundamental improvements in DNA computing is the direct-proportional length-based DNA computing. 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.
|
|---|
