Results 1 - 10
of
773
The program-size complexity of self-assembled squares
- In Proceedings of the thirty-second annual ACM symposium on Theory of computing
, 2000
"... ..."
(Show Context)
Algorithmic Self-Assembly of DNA
, 1998
"... How can molecules compute? In his early studies of reversible computation, Bennett imagined an enzymatic Turing Machine which modified a hetero-polymer (such as DNA) to perform computation with asymptotically low energy expenditures. Adleman's recent experimental demonstration of a DNA computat ..."
Abstract
-
Cited by 156 (6 self)
- Add to MetaCart
How can molecules compute? In his early studies of reversible computation, Bennett imagined an enzymatic Turing Machine which modified a hetero-polymer (such as DNA) to perform computation with asymptotically low energy expenditures. Adleman's recent experimental demonstration of a DNA computation, using an entirely different approach, has led to a wealth of ideas for how to build DNA-based computers in the laboratory, whose energy efficiency, information density, and parallelism may have potential to surpass conventional electronic computers for some purposes. In this thesis, I examine one mechanism used in all designs for DNA-based computer -- the self-assembly of DNA by hybridization and formation of the double helix -- and show that this mechanism alone in theory can perform universal computation. To do so, I borrow an important result in the mathematical theory of tiling: Wang showed how jigsaw-shaped tiles can be designed to simulate the operation of any Turing Machine. I propose...
Logical computation using algorithmic self-assembly of dna triple-crossover molecules
- Nature
, 2000
"... Recent work has demonstrated the self-assembly of designed periodic two-dimensional arrays composed of DNA tiles, in which the intermolecular contacts are directed by 'sticky ' ends. In a mathematical context, aperiodic mosaics may be formed by the self-assembly of 'Wang ' tiles ..."
Abstract
-
Cited by 118 (20 self)
- Add to MetaCart
Recent work has demonstrated the self-assembly of designed periodic two-dimensional arrays composed of DNA tiles, in which the intermolecular contacts are directed by 'sticky ' ends. In a mathematical context, aperiodic mosaics may be formed by the self-assembly of 'Wang ' tiles 4, a process that emulates the operation of a Turing machine. Macroscopic self-assembly has been used to perform computations 5; there is also a logical equivalence between DNA sticky ends and Wang tile edges 6, 7. This suggests that the self-assembly of DNA-based tiles could be used to perform DNA-based computation 8. Algorithmic aperiodic self-assembly requires greater fidelity than periodic self-assembly, because correct tiles must compete with partially correct tiles. Here we report a one-dimensional algorithmic self-assembly of DNA triple-crossover molecules 9 that can be used to execute four steps of a logical (cumulative XOR) operation on a string of binary bits. A variety of different DNA tile types have been used in previous assemblies, including double-crossover molecules 1, triple-crossover molecules 9, and parallelograms produced from Holliday junction analogues 3.
Universal computation via self-assembly of DNA: Some theory and experiments
- In DNA Based Computers II, volume 44 of DIMACS
, 1996
"... In this paper we examine the computational capabilities inherent inthehybridization of DNA molecules. First we consider theoretical models, and show that the self-assembly of oligonucleotides into linear duplex DNA can only generate sets of sequences equivalent to regular languages. If branched DNA ..."
Abstract
-
Cited by 100 (12 self)
- Add to MetaCart
(Show Context)
In this paper we examine the computational capabilities inherent inthehybridization of DNA molecules. First we consider theoretical models, and show that the self-assembly of oligonucleotides into linear duplex DNA can only generate sets of sequences equivalent to regular languages. If branched DNA is used for self-assembly of dendrimer structures, only sets of sequences equivalent tocontext-free languages can be achieved. In contrast, the self-assembly of double crossover molecules into two dimensional sheets or three dimensional solids is theoretically capable of universal computation. The proof relies on a very direct simulation of a universal class of cellular automata. In the second part of this paper, we present results from preliminary experiments which investigate the critical computational step in atwo-dimensional self-assembly process. 1
Simulations of Computing by Self-Assembly
, 1998
"... Winfree (1996) proposed a Turing-universal model of DNA self-assembly. In this abstract model, DNA double-crossover molecules self-assemble to form an algorithmically-patterned two-dimensional lattice. Here, we develop a more realistic model based on the thermodynamics and kinetics of oligonucleo ..."
Abstract
-
Cited by 91 (15 self)
- Add to MetaCart
(Show Context)
Winfree (1996) proposed a Turing-universal model of DNA self-assembly. In this abstract model, DNA double-crossover molecules self-assemble to form an algorithmically-patterned two-dimensional lattice. Here, we develop a more realistic model based on the thermodynamics and kinetics of oligonucleotide hydridization. Using a computer simulation, we investigate what physical factors influence the error rates, i.e., when the more realistic model deviates from the ideal of the abstract model. We find, in agreement with rules of thumb for crystal growth, that the lowest error rates occur at the melting temperature when crystal growth is slowest, and that error rates can be made arbitrarily low by decreasing concentration and increasing binding strengths. 1 Introduction Early work in DNA computing (Adleman 1994; Lipton 1995; Boneh et al. 1996; Ouyang et al. 1997) showed how computations can be accomplished by first creating a combinatorial library of DNA and then, through successiv...
On the Computational Power of DNA Annealing and Ligation
- DNA Based Computers, volume 27 of DIMACS
, 1995
"... In [Winfree] it was shown that the DNA primitives of Separate, Merge, and Amplify were not sufficiently powerful to invert functions defined by circuits in linear time. Dan Boneh et al [Boneh] show that the addition of a ligation primitive, Append, provides the missing power. The question becomes, & ..."
Abstract
-
Cited by 87 (19 self)
- Add to MetaCart
(Show Context)
In [Winfree] it was shown that the DNA primitives of Separate, Merge, and Amplify were not sufficiently powerful to invert functions defined by circuits in linear time. Dan Boneh et al [Boneh] show that the addition of a ligation primitive, Append, provides the missing power. The question becomes, "How powerful is ligation? Are Separate, Merge, and Amplify necessary at all?" This paper proposes to informally explore the power of annealing and ligation for DNA computation. We conclude, in fact, that annealing and ligation alone are theoretically capable of universal computation. 1 Introduction When Len Adleman introduced the paradigm of using DNA to solve combinatorial problems [Adleman], his computational scheme involved two distinct phases. To solve the directed Hamiltonian path problem, he first mixed together in a test tube a carefully designed set of DNA oligonucleotide "building blocks", which anneal to each other and are ligated to create long strands of DNA representing paths t...
A DNA and restriction enzyme implementation of Turing Machines.
- DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
"... Bacteria employ restriction enzymes to cut or restrict DNA at or near specific words in a unique way. Many restriction enzymes cut the two strands of double-stranded DNA at different positions leaving overhangs of single-stranded DNA. Two pieces of DNA may be rejoined or ligated if their terminal ov ..."
Abstract
-
Cited by 84 (1 self)
- Add to MetaCart
Bacteria employ restriction enzymes to cut or restrict DNA at or near specific words in a unique way. Many restriction enzymes cut the two strands of double-stranded DNA at different positions leaving overhangs of single-stranded DNA. Two pieces of DNA may be rejoined or ligated if their terminal overhangs are complementary. Using these operations fragments of DNA, or oligonucleotides, may be inserted and deleted from a circular piece of plasmid DNA. We propose an encoding for the transition table of a Turing machine in DNA oligonucleotides and a corresponding series of restrictions and ligations of those oligonucleotides that, when performed on circular DNA encoding an instantaneous description of a Turing machine, simulate the operation of the Turing machine encoded in those oligonucleotides. DNA based Turing machines have been proposed by Charles Bennett but they invoke imaginary enzymes to perform the state-symbol transitions. Our approach differs in that every operation can be pe...
Breaking DES Using a Molecular Computer
, 1995
"... Recently Adleman [1] has shown that a small traveling salesman problem can be solved by molecular operations. In this paper we show how the same principles can be applied to breaking the Data Encryption Standard (DES). Our method is based on an encoding technique presented in Lipton [8]. We describe ..."
Abstract
-
Cited by 70 (4 self)
- Add to MetaCart
(Show Context)
Recently Adleman [1] has shown that a small traveling salesman problem can be solved by molecular operations. In this paper we show how the same principles can be applied to breaking the Data Encryption Standard (DES). Our method is based on an encoding technique presented in Lipton [8]. We describe in detail a library of operations which are useful when working with a molecular computer. We estimate that given one arbitrary (plain-text, cipher-text) pair, one can recover the DES key in about 4 months of work. Furthermore, if one is given cipher-text, but the plain text is only known to be one of several candidates then it is still possible to recover the key in about 4 months of work. Finally, under chosen cipher-text attack it is possible to recover the DES key in one day using some preprocessing. 1 Introduction Due to advances in molecular biology it is nowadays possible to create a soup of roughly 10 18 DNA strands that fits in a small glass of water. Adleman [1] has shown that e...
