Efficiency and Reliability of DNA-Based Memories

Associative memories based on DNA-affinity have been proposed [2]. Here, the performance, efficiency, reliability of DNA-based memories is quantified through simulations in silico. Retrievals occur reliably (98%) within very short times (milliseconds) despite the randomness of the reactions and regardless of the number of queries. The capacity of these memories is also explored in practice and compared with previous theoretical estimates. Advantages of implementations of the same type of memory in special purpose chips in silico is proposed and discussed.

[1]  N. Seeman,et al.  Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.

[2]  M AdlemanLeonard.  Molecular computation of solutions to combinatorial problems , 1994 .

[3]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[4]  Junghuei Chen,et al.  A Software Tool for Generating Non-crosshybridizing Libraries of DNA Oligonucleotides , 2002, DNA.

[5]  Max H. Garzon,et al.  Biomolecular computing and programming , 1999, IEEE Trans. Evol. Comput..

[6]  E B Baum,et al.  Building an associative memory vastly larger than the brain. , 1995, Science.

[7]  Max H. Garzon,et al.  Self-Assembly of DNA-like Structures In Silico , 2003, Genetic Programming and Evolvable Machines.

[8]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[9]  Max H. Garzon.  Biomolecular computing in silico, Natural Computing Column , 2003, Bull. EATCS.

[10]  Grzegorz Rozenberg,et al.  DNA computing using single-molecule hybridization detection. , 2004, Nucleic acids research.

[11]  Max H. Garzon,et al.  Codeword design and information encoding in DNA ensembles , 2004, Natural Computing.

[12]  David Harlan Wood,et al.  A PCR-based Protocol for In Vitro Selection of Non-crosshybridizing Oligonucleotides , 2002, DNA.

[13]  Max H. Garzon,et al.  Reliability and Efficiency of a DNA-Based Computation , 1998 .

[14]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[15]  Max H. Garzon,et al.  Biomolecular Computation in Virtual Test Tubes , 2001, DNA.

[16]  James G. Wetmur.  Physical chemistry of nucleic acid hybridization , 1997, DNA Based Computers.

[17]  Byoung-Tak Zhang,et al.  Temperature Gradient-Based DNA Computing for Graph Problems with Weighted Edges , 2002, DNA.

[18]  Amit Marathe,et al.  On combinatorial DNA word design , 1999, DNA Based Computers.

[19]  John H. Reif,et al.  Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search Using Error-Correcting Codes and Vector-Quantization , 2000, DNA Computing.