DNA Library Design for Molecular Computation

A novel approach to designing a DNA library for molecular computation is presented. The method is employed for encoding binary information in DNA molecules. It aims to achieve a practical discrimination between perfectly matched DNA oligomers and those with mismatches in a large pool of different molecules. The approach takes into account the ability of DNA strands to hybridize in complex structures like hairpins, internal loops, or bulge loops and computes the stability of the hybrids formed based on thermodynamic data. A dynamic programming algorithm is applied to calculate the partition function for the ensemble of structures, which play a role in the hybridization reaction. The applicability of the method is demonstrated by the design of a twelve-bit DNA library. The library is constructed and experimentally tested using molecular biology tools. The results show a high level of specific hybridization achieved for all library words under identical conditions. The method is also applicable for the design of primers for PCR, DNA sequences for isothermal amplification reactions, and capture probes in DNA-chip arrays. The library could be applied for integrated DNA computing of twelve-bit instances of NP-complete combinatorial problems by multi-step DNA selection in microflow reactors.

[1]  Jin Woo Kim,et al.  Characterization of Non-crosshybridizing DNA Oligonucleotides Manufactured in vitro , 2004, Natural Computing.

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

[3]  L F Landweber,et al.  Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

[4]  H. Blöcker,et al.  Predicting DNA duplex stability from the base sequence. , 1986, Proceedings of the National Academy of Sciences of the United States of America.

[5]  J. Wetmur.  DNA probes: applications of the principles of nucleic acid hybridization. , 1991, Critical reviews in biochemistry and molecular biology.

[6]  J. SantaLucia,et al.  A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Michael C. Pirrung,et al.  The Arrayed Primer Extension Method for DNA Microchip Analysis. Molecular Computation of Satisfaction Problems , 2000 .

[8]  A. Condon,et al.  Demonstration of a word design strategy for DNA computing on surfaces. , 1997, Nucleic acids research.

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

[10]  John S. McCaskill,et al.  Cascadable Hybridisation Transfer of Specific DNA between Microreactor Selection Modules , 2001, DNA.

[11]  Byoung-Tak Zhang,et al.  Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing , 2005, IEEE Transactions on Evolutionary Computation.

[12]  P. Pevzner,et al.  An Eulerian path approach to DNA fragment assembly , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Walter Fontana,et al.  Fast folding and comparison of RNA secondary structures , 1994 .

[14]  Kalim U. Mir.  A restricted genetic alphabet for DNA computing , 1996, DNA Based Computers.

[15]  Clifford R. Johnson,et al.  Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.

[16]  P D Kaplan,et al.  DNA solution of the maximal clique problem. , 1997, Science.

[17]  S. Mangru,et al.  Dynamic DNA hybridization on a chip using paramagnetic beads. , 1999, Analytical chemistry.

[18]  J. Sambrook,et al.  Molecular Cloning: A Laboratory Manual , 2001 .

[19]  D K Gifford,et al.  On the path to computation with DNA. , 1994, Science.

[20]  A D Ellington,et al.  The fidelity of template-directed oligonucleotide ligation and its relevance to DNA computation. , 1998, Nucleic acids research.

[21]  D. Kelso,et al.  DNA hybridization on microparticles: determining capture-probe density and equilibrium dissociation constants. , 1999, Nucleic acids research.

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

[23]  J. McCaskill,et al.  End-specific covalent photo-dependent immobilisation of synthetic DNA to paramagnetic beads. , 2000, Nucleic acids research.

[24]  R. Breaker,et al.  Mechanism for allosteric inhibition of an ATP-sensitive ribozyme. , 1998, Nucleic acids research.

[25]  J C Cox,et al.  The complexities of DNA computation. , 1999, Trends in biotechnology.

[26]  J S McCaskill.  Optically programming DNA computing in microflow reactors. , 2001, Bio Systems.

[27]  J. SantaLucia,et al.  Thermodynamics and NMR of internal G.T mismatches in DNA. , 1997, Biochemistry.

[28]  Shi V. Liu.  Debating controversies can enhance creativity , 2000, Nature.

[29]  Leonard M. Adleman,et al.  Solution of a Satisfiability Problem on a Gel-Based DNA Computer , 2000, DNA Computing.

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

[31]  Lloyd M. Smith,et al.  DNA computing on surfaces , 2000, Nature.

[32]  Richard J. Lipton,et al.  DNA Based Computers , 1996 .

[33]  R. Breaker,et al.  Computational design and experimental validation of oligonucleotide-sensing allosteric ribozymes , 2005, Nature Biotechnology.

[34]  J. McCaskill.  The equilibrium partition function and base pair binding probabilities for RNA secondary structure , 1990, Biopolymers.

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