Results 251 to 260 of about 333,155 (283)
Some of the next articles are maybe not open access.
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
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
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 +2 more sources
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 +2 more sources
PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA
International Journal of Foundations of Computer Science, 2007In recent works for high performance computing, computation with DNA strands, that is, DNA computing, has considerable attention as one of non-silicon based computing. In this paper, we propose three procedures for computing the maximum of n binary numbers of m bits, which are represented with O(mn) DNA strands.
Akihiro Fujiwara +2 more
openaire +2 more sources
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, 2021Chao Zhang, Mingzhi Zhang, Da Han
exaly
Future DNA computing device and accompanied tool stack: Towards high-throughput computation
Future Generation Computer Systems, 2021Shankai Yan, Ka-Chun Wong
exaly
Multi‐Mode Reconfigurable DNA‐Based Chemical Reaction Circuits for Soft Matter Computing and Control
Angewandte Chemie - International Edition, 2021Qian Tang, Wei Lai, Xiewei Xiong
exaly