
handle: 11568/582267
Summary: The aim of this report is to review DNA computing. It was born three years ago, when molecular biology was used to implement a new way of solving an NP-complete problem. The idea (due to Leonard Adleman in Science, November 1994) is to use strands of DNA to encode an (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 solution of the problem, if it exists. Motivated by Adleman's paper, many researchers have been interested in DNA computing. We present an overview of the discussions and the results that have appeared in the literature.
DNA computing, Computing methodologies and applications, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), Protein sequences, DNA sequences
DNA computing, Computing methodologies and applications, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), Protein sequences, DNA sequences
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
