Genetic Search of Reliable Encodings for DNA-Based Computation

Created by W.Langdon from gp-bibliography.bib Revision:1.8081

@InProceedings{deaton:1996:gsreDNA,

• author = "R. Deaton and M. Garzon and R. C. Murphy and J. A. Rose and D. R. Franceschetti and S. E. {Stevens, Jr.}",
• title = "Genetic Search of Reliable Encodings for {DNA}-Based Computation",
• booktitle = "Late Breaking Papers at the Genetic Programming 1996 Conference Stanford University July 28-31, 1996",
• year = "1996",
• editor = "John R. Koza",
• pages = "9--15",
• address = "Stanford University, CA, USA",
• publisher_address = "Stanford University, Stanford, California 94305-3079, USA",
• month = "28--31 " # jul,
• publisher = "Stanford Bookstore",
• ISBN = "0-18-201031-7",
• keywords = "genetic algorithms, genetic programming",
• URL = "http://www.csce.uark.edu/~rdeaton/dna/papers/gp-96.pdf",
• size = "7 pages",
• abstract = "In DNA-based computation, the problem instances are encoded in DNA oligonucleotides that must hybridise correctly to produce a solution. Depending on reaction conditions, oligonucleotides can bind with imperfect matching of complementary base pairs. These mismatched hybridisations are a potential source of errors. For reliable DNA-based computation, the encodings should be a minimum distance apart. This distance could be estimated from empirical curves of DNA melting, but they remain difficult to produce. In fact, the probability of a good encoding in a randomly chosen sample goes to zero fairly quickly with the number of errors for arbitrary encoding lengths. We use genetic programming methods to nd good encodings and analyse their performance in actual laboratory experiments.",
• notes = "GP-96LB The email address for the bookstore for mail orders is mailorder@bookstore.stanford.edu Phone no 415-329-1217 or 800-533-2670",

}

Genetic Programming entries for R Deaton Max H Garzon R C Murphy John Anthony Rose D R Franceschetti S E Stevens Jr

Citations