Results 261 to 270 of about 127,811 (292)
Some of the next articles are maybe not open access.
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
Journal of Computer Science and Technology, 2004
As an emerging new research area, DNA computation, or more generally biomolecular computation, extends into other fields such as nanotechnology and material design, and is developing into a new sub-discipline of science and engineering. This paper provides a brief survey of some concepts and developments in this area.
openaire +1 more source
As an emerging new research area, DNA computation, or more generally biomolecular computation, extends into other fields such as nanotechnology and material design, and is developing into a new sub-discipline of science and engineering. This paper provides a brief survey of some concepts and developments in this area.
openaire +1 more source
2002
Although DNA (deoxy-ribo nucleic acid) can perform 1022 computations per second, it is time intensive and complex to set up input and output of data to and from a biological computer and to filter the final result. This paper, discusses how to simulate DNA computing on a digital computer to solve the Hamiltonian path problem using Adleman's model.
openaire +1 more source
Although DNA (deoxy-ribo nucleic acid) can perform 1022 computations per second, it is time intensive and complex to set up input and output of data to and from a biological computer and to filter the final result. This paper, discusses how to simulate DNA computing on a digital computer to solve the Hamiltonian path problem using Adleman's model.
openaire +1 more source
1999
This paper addresses two main aspects of DNA computing research: DNA computing in vitro and in vivo. We first present a model of DNA computation developed in [5]: the circular insertion/deletion system. We review the result obtained in [5] stating that this system has the computational power of a Turing machine, and present the outcome of a molecular ...
Lila Kari +4 more
openaire +1 more source
This paper addresses two main aspects of DNA computing research: DNA computing in vitro and in vivo. We first present a model of DNA computation developed in [5]: the circular insertion/deletion system. We review the result obtained in [5] stating that this system has the computational power of a Turing machine, and present the outcome of a molecular ...
Lila Kari +4 more
openaire +1 more source
An Analysis of Computational Efficiency of DNA Computing
2002In this paper, we investigate the relation between an experimental condition and computational (reaction) efficiency of a simple model in DNA computing. A DNA computing algorithm needs many chemical and enzyme reactions in its solution process. An experimental condition for DNA computing is generally based on a molecular biology protocol.
Atsushi Kameda +3 more
openaire +1 more source
Bull. EATCS, 1998
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 ...
openaire +1 more source
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 ...
openaire +1 more source
DNA-based programmable gate arrays for general-purpose DNA computing
Nature, 2023Nuli Xie, Mingqiang Li, Mingkai Dong
exaly
DNA Computing: Principle, Construction, and Applications in Intelligent Diagnostics
Small Structures, 2021Qian Ma, Chao Zhang, Mingzhi Zhang
exaly
Future DNA computing device and accompanied tool stack: Towards high-throughput computation
Future Generation Computer Systems, 2021Shankai Yan, Ka-Chun Wong
exaly