PUNCH: An Evolutionary Algorithm for Optimizing Bit Set Selection

Nearly every nucleotide-based computing problem attempted thus far has involved the prearranged assignment of nucleotide sequences to represent bits. However, no general program is yet available to optimize those bit sequences. Careful selection of bit sequences can promote strong annealing between a bit and its intended complement while at the same time minimizing unintended interactions with other bits. In this paper, we present a program that uses an evolutionary algorithm to generate optimum bit sets using given (changeable) criteria. We also test some properties of the program and discuss future applications.

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

[2]  W. Vent,et al.  Rechenberg, Ingo, Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 170 S. mit 36 Abb. Frommann‐Holzboog‐Verlag. Stuttgart 1973. Broschiert , 1975 .

[3]  Douglas H. Turner,et al.  17 Thermodynamic Considerations for Evolution by RNA , 1993 .

[4]  B. Ganem.  RNA world , 1987, Nature.

[5]  S A Benner,et al.  Expanding the genetic lexicon: incorporating non-standard amino acids into proteins by ribosome-based synthesis. , 1994, Trends in biotechnology.

[6]  R A Fisher,et al.  Darwinian evolution of mutations. , 1922, The Eugenics review.

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

[8]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[9]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10]  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.

[11]  Ronald W. Davis,et al.  Quantitative phenotypic analysis of yeast deletion mutants using a highly parallel molecular bar–coding strategy , 1996, Nature Genetics.

[12]  Max H. Garzon,et al.  Good encodings for DNA-based solutions to combinatorial problems , 1996, DNA Based Computers.

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

[14]  W. Salser.  Globin mRNA sequences: analysis of base pairing and evolutionary implications. , 1978, Cold Spring Harbor symposia on quantitative biology.

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

[16]  A. Condon,et al.  Progress toward demonstration of a surface based DNA computation: a one word approach to solve a model satisfiability problem. , 1999, Bio Systems.

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

[18]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

[20]  L F Landweber,et al.  Chess games: a model for RNA based computation. , 1999, Bio Systems.

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

[22]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[23]  Steven A. Benner,et al.  Enzymatic incorporation of a new base pair into DNA and RNA extends the genetic alphabet , 1990, Nature.

[24]  R. Lerner,et al.  Encoded combinatorial chemistry. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

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