| L.Adleman. On Constructing A Molecular Computer. DNA Based Computers (Selected papers from Proc. of DIMACS Workshop on DNA Based Computers '95), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 27, pp.1-21, 1996. 13 |
....Computing is a novel computing paradigm recently emerged from and stimulated by a groundbreaking wet lab experimental work by Adleman in 1994. Since then, a great number of computation models have been proposed in the context of both biomolecular experiments and theoretical computer science (e.g. [2, 3, 7, 9, 10, 11, 13, 17, 19, 20]) trying to break through the so called NP completeness barrier or to establish new computation paradigms with universal capability. This paper proposes new computing paradigms based on self assembly and conformational change. These two principles have already appeared in an extensive variety of ....
L.Adleman. On Constructing A Molecular Computer. DNA Based Computers (Selected papers from Proc. of DIMACS Workshop on DNA Based Computers '95), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 27, pp.1-21, 1996. 13
.... Hamiltonian path problem, which is known to be NP Complete, opens the door to the highly parallel computation using molecules ( Adl94] His study was followed by many researches: generalizing his technique( Lip95a] Lip95b] providing abstract DNA computer models with Turing computability([Adl95] [Bea95] WR95] and so forth. In spite of those efforts on pursuing possible implementation of DNA computers with Turing computability using a finite set of biological operations, there is no commonly admissible models for the DNA computation yet. In this paper, we discuss the DNA implementation ....
L. Adleman. On Constructing A Molecular Computer. DNA Based Computers (Selected Papaers from Proc. of DIMACS Workshop on DNA Based Computers'95), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 27, pp.1-21, 1996.
....on this new computation paradigm have been published. In fact, Adleman s model has been extensively studied by many researches, for generalizing his technique to solve larger class of problems ( Lip95a] Lip95b] Bea95] for providing abstract DNA computer models with Turing computability ([Adl95], Bea95] Rot95] WYS96] and so forth. In spite of those efforts on pursuing possible implementation methods for DNA computers with Turing computability using a finite set of molecular biological operations, there is no commonly acceptable models of DNA computation yet. In this paper, we ....
....return yes if I(T ) contains (at least) one complete double stranded string, and no otherwise. Note that : i) Applying AM enables us to use set variables as many times as desired at any time in the programming via DNA EC. ii) An operation EM is often called Detect in some literature (e.g. [Adl95]) Thus, EM in this paper answers yes when the test tube is non empty, while the one in [RW96] answers yes when it is empty. iii) EQ is a double stranded version of EM to detect whether or not there is a completely hybridized double string in the test tube. Let k 0 and let T ; T 1 ; T 2 be ....
L.Adleman. On Constructing A Molecular Computer. DNA Based Computers (Selected papers from Proc. of DIMACS Workshop on DNA Based Computers'95), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 27, pp.1-21, 1996.
No context found.
L.Adleman. On Constructing A Molecular Computer. DNA Based Computers (Selected papers from Proc. of DIMACS Workshop on DNA Based Computers'95), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 27, pp.1-21, 1996.
No context found.
L.Adleman. On Constructing A Molecular Computer. DNA Based Computers (Selected papers from Proc. of DIMACS Workshop on DNA Based Computers'95), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 27, pp.1-21, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC