The importance of DNA sequence design for reliable DNA computing is well recognized. In this paper, we describe a DNA sequence optimization system NACST/Seq that is based on a multiobjective genetic algorithm. It uses the concept of Pareto optimization to reflect many realistic characteristics of DNA sequences in real bio-chemical experiments flexibly. This feature allows to recommend multiple ...

In this paper, we rst summarize the research that has been completed in the eld of DNA computing and the research problems that must be overcome if the technique of computing with molecules is to become practical. We then propose a new direction in research towards autonomous molecular computers , describe the author's work on the implementation of state machines using DNA molecules, and discus...

We propose a novel molecular computing approach based on reservoir computing. In reservoir computing, a dynamical core, called a reservoir, is perturbed with an external input signal while a readout layer maps the reservoir dynamics to a target output. Computation takes place as a transformation from the input space to a high-dimensional spatiotemporal feature space created by the transient dyn...

The use of Cloud Computing has increasedrapidly in many organization .Cloud Computing provides many benefits in terms of low cost and accessibility of data. In addition Cloud Computing was predicted to transform the computing world from using local applications and storage into centralized services provided by organization.[10] Ensuring the security of Cloud Computing is major factor in the Clo...

DNA computing has recently gained intensive attention as an emerging field bridging the gap between computer science and biomolecular science. DNA based computing can be competitively used to simulate various computing models including Boolean circuits because of its potential to offer massive parallelism. In this paper we present a new DNA-based evaluation algorithm for a bounded fan-in circui...

A new method of computing using DNA plasmids is introduced and the potential advantages are listed. The new method is illustrated by reporting a laboratory computation of an instance of the NP-complete algorithmic problem of computing the cardinal number of a maximal independent subset of the vertex set of a graph. A circular DNA plasmid, specifically designed for this method of molecular compu...

In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has been receiving considerable attention as an alternative for silicon based computers. In this paper, we propose two procedures for computing multiple input functions. We first propose a simple procedure for computing AND function. The procedure runs in O(1) steps using O(mn) DNA strands fo...

The aim of this report is to make a review on DNA computing: molecular biology is used to suggest a new way of solving a NP-complete problem. The idea (due to Leonard Adleman in Adl94]) is to use strands of DNA to encode the (instance of the) problem, and to manipulate them using techniques commonly available in any molecular biology laboratory, in order to simulate operations that select the s...

DNA computing is a novel method for solving a class of intractable computational problems, in which the computing time can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability, among which a surface-based method is an efficient candidate. In this paper, the surface-based approach proposed by Liu, Q., Wan...

In 1994, University of Southern California computer scientist Dr. Leonard Adelman solved the Hamiltonian Path Problem using DNA as a computational mechanism. He proved the principle that DNA computing could be used to solve computationally complex problems. Because of the limitations in discovery time, resource requirements, and sequence mismatches, DNA computing has not yet become a commonly a...