In this paper I present a new model that employs a biological (specifically DNA -based) substrate for performing computation. Specifically, I describe strategies for performing parallel function application in the DNA-computing models described by Adelman, Cai et. al., and Liu et. al. Employing only DNA operations which can presently be performed, I discuss some direct algorithms for computing a variety of useful mathematical functions on DNA, culminating in an algorithm for minimizing an arbitrary continuous function. In addition, computing genetic algorithms on a DNA substrate is briefly discussed
DNA computing appeared in the literature in 1994 when Leonard Adleman suggested to solve an NP-compl...
This thesis focuses on the design and implementation of an application involving the principles of D...
We show how DNA molecules and standard lab techniques may be used to create a nondeterministic Turin...
In this paper I describe and extend a new DNA computing paradigm introduced in Blumberg for buildi...
DNA computation investigates the potential of DNA as a massively parallel computing device. Research...
DNA computation investigates the potential of DNA as a massively parallel computing device. Research...
Much of our scientific, technological, and economic future depends on the availability of an ever-in...
The rapid developments in the field of DNA computing reflects two substantial questions: 1. Which mo...
AbstractThe demonstration that DNA molecules can act as parallel processors to solve hard problems h...
DNA computation is to use DNA molecules for information storing and processing. The task is accompli...
AbstractWe show how DNA-based computers can be used to solve the satisfiability problem for boolean ...
DNA Computing aims to harness the molecules at the Nano level for computational purpose. DNA Computi...
DNA computing is a discipline that aims at harnessing individual molecules at the nano-scopic level ...
DNA computing appeared in the literature in 1994 when Leonard Adleman suggested to solve an NP-compl...
It has been previously shown that DNA computing can solve those problems currently intractable on ev...
DNA computing appeared in the literature in 1994 when Leonard Adleman suggested to solve an NP-compl...
This thesis focuses on the design and implementation of an application involving the principles of D...
We show how DNA molecules and standard lab techniques may be used to create a nondeterministic Turin...
In this paper I describe and extend a new DNA computing paradigm introduced in Blumberg for buildi...
DNA computation investigates the potential of DNA as a massively parallel computing device. Research...
DNA computation investigates the potential of DNA as a massively parallel computing device. Research...
Much of our scientific, technological, and economic future depends on the availability of an ever-in...
The rapid developments in the field of DNA computing reflects two substantial questions: 1. Which mo...
AbstractThe demonstration that DNA molecules can act as parallel processors to solve hard problems h...
DNA computation is to use DNA molecules for information storing and processing. The task is accompli...
AbstractWe show how DNA-based computers can be used to solve the satisfiability problem for boolean ...
DNA Computing aims to harness the molecules at the Nano level for computational purpose. DNA Computi...
DNA computing is a discipline that aims at harnessing individual molecules at the nano-scopic level ...
DNA computing appeared in the literature in 1994 when Leonard Adleman suggested to solve an NP-compl...
It has been previously shown that DNA computing can solve those problems currently intractable on ev...
DNA computing appeared in the literature in 1994 when Leonard Adleman suggested to solve an NP-compl...
This thesis focuses on the design and implementation of an application involving the principles of D...
We show how DNA molecules and standard lab techniques may be used to create a nondeterministic Turin...