Results 211 to 220 of about 122,806 (254)
A Sociotechnical Approach to Genomic Data Privacy: A Comparative Analysis. [PDF]
Int Data Priv LawSherkow JS.
europepmc +1 more source
Intracellular logic computing with DNA tetrahedron processors enables precision cancer theranostics. [PDF]
Signal Transduct Target TherGao Y +13 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Current Opinion in Biotechnology, 1997
DNA computation is a novel and exciting recent development at the interface of computer science and molecular biology. We describe the current activity in this field following the seminal work of Adleman, who recently showed how techniques of molecular biology may be applied to the solution of a computationally intractable problem.
A, Gibbons, M, Amos, D, Hodgson
openaire +2 more sources
DNA computation is a novel and exciting recent development at the interface of computer science and molecular biology. We describe the current activity in this field following the seminal work of Adleman, who recently showed how techniques of molecular biology may be applied to the solution of a computationally intractable problem.
A, Gibbons, M, Amos, D, Hodgson
openaire +2 more sources
International Journal of Nanotechnology and Molecular Computation, 2010
DNA computing is widely accepted as a new computing framework all over the world. In this chapter, the background of DNA computing is firstly introduced by solving a Hamilton Path problem. Then three research directions are proposed according to the current development of it, including the theoretical framework, practical DNA computing models and DNA ...
Tao Song 0001 +3 more
openaire +1 more source
DNA computing is widely accepted as a new computing framework all over the world. In this chapter, the background of DNA computing is firstly introduced by solving a Hamilton Path problem. Then three research directions are proposed according to the current development of it, including the theoretical framework, practical DNA computing models and DNA ...
Tao Song 0001 +3 more
openaire +1 more source
Computing in Science & Engineering, 2002
Computer scientists are joining forces with molecular biologists and chemists to explore the potential for computation using information-carrying biological polymers such as nucleic acids (DNA and RNA). DNA computing is a subset of molecular computing. The key feature of DNA for computing is its information content.
openaire +2 more sources
Computer scientists are joining forces with molecular biologists and chemists to explore the potential for computation using information-carrying biological polymers such as nucleic acids (DNA and RNA). DNA computing is a subset of molecular computing. The key feature of DNA for computing is its information content.
openaire +2 more sources
Nature, 2000
DNA computing was proposed as a means of solving a class of intractable computational problems in which the computing time can grow exponentially with problem size (the 'NP-complete' or non-deterministic polynomial time complete problems). The principle of the technique has been demonstrated experimentally for a simple example of the hamiltonian path ...
Q, Liu +5 more
openaire +2 more sources
DNA computing was proposed as a means of solving a class of intractable computational problems in which the computing time can grow exponentially with problem size (the 'NP-complete' or non-deterministic polynomial time complete problems). The principle of the technique has been demonstrated experimentally for a simple example of the hamiltonian path ...
Q, Liu +5 more
openaire +2 more sources
The complexities of DNA computation
Trends in Biotechnology, 1999Over the past few years, a handful of insightful researchers have bridged the gap between biological computing theory and actual DNA-based computation. By using ingenious encoding techniques and clever molecular-biological manipulations, simple versions of computationally complex problems have been experimentally approached or resolved.
J C, Cox, D S, Cohen, A D, Ellington
openaire +2 more sources
Journal of Computational Biology, 1995
We consider molecular models for computing and derive a DNA-based mechanism for solving intractable problems through massive parallelism. In principle, such methods might reduce the effort needed to solve otherwise difficult tasks, such as factoring large numbers, a computationally intensive task whose intractability forms the basis for much of modern ...
openaire +2 more sources
We consider molecular models for computing and derive a DNA-based mechanism for solving intractable problems through massive parallelism. In principle, such methods might reduce the effort needed to solve otherwise difficult tasks, such as factoring large numbers, a computationally intensive task whose intractability forms the basis for much of modern ...
openaire +2 more sources
1996
The idea that living cells and molecular complexes can be viewed as potential machinic components dates back to the late 1950s, when Richard Feynman delivered his famous paper describing sub-microscopic computers. Recently, several papers have advocated the realisation of massively parallel computation using the techniques and chemistry of molecular ...
Alan Gibbons +2 more
openaire +1 more source
The idea that living cells and molecular complexes can be viewed as potential machinic components dates back to the late 1950s, when Richard Feynman delivered his famous paper describing sub-microscopic computers. Recently, several papers have advocated the realisation of massively parallel computation using the techniques and chemistry of molecular ...
Alan Gibbons +2 more
openaire +1 more source
Soft Computing, 1999
Inspired by the experiments reported recently in the emerging area of DNA computing, we consider a somewhat unusual type of a computation strategy: generate a (large) set of candidate solutions of a problem, then remove the non-solutions such that what remains is the set of solutions. We call this a computation by carving.
openaire +1 more source
Inspired by the experiments reported recently in the emerging area of DNA computing, we consider a somewhat unusual type of a computation strategy: generate a (large) set of candidate solutions of a problem, then remove the non-solutions such that what remains is the set of solutions. We call this a computation by carving.
openaire +1 more source