Results 261 to 270 of about 3,749,303 (292)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +3 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 +3 more sources
International Journal of Scientific Research and Engineering Trends
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.
+4 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.
+4 more sources
Circulating Tumor DNA in Advanced Solid Tumors: Clinical Relevance and Future Directions
Ca-A Cancer Journal for Clinicians, 2021Heather Parsons +2 more
exaly
DNA-Based Programmable Gate Arrays for General-Purpose DNA Computing
Nature, 2023Xiaolei Zuo, Lei Zhao, Chunhai Fan
exaly