Results 221 to 230 of about 122,806 (254)
Some of the next articles are maybe not open access.
Fundamenta Informaticae, 1998
DNA computing holds out the promise of important and significant connections between computers and living systems, as well as promising massively parallel computations. Before these promises are fulfilled, however, important challenges related to errors and practicality have to be addressed.
Russell J. Deaton +4 more
openaire +2 more sources
DNA computing holds out the promise of important and significant connections between computers and living systems, as well as promising massively parallel computations. Before these promises are fulfilled, however, important challenges related to errors and practicality have to be addressed.
Russell J. Deaton +4 more
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
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 +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
Circulating tumor DNA in advanced solid tumors: Clinical relevance and future directions
Ca-A Cancer Journal for Clinicians, 2021Heather A Parsons +2 more
exaly
DNA-based programmable gate arrays for general-purpose DNA computing
Nature, 2023Xiaolei Zuo, Lei Zhao, Chunhai Fan
exaly