%0 Conference Paper %1 zhang:1998:maerDNAc %A Zhang, Byoung-Tak %A Shin, Soo-Yong %B Genetic Programming 1998: Proceedings of the Third Annual Conference %C University of Wisconsin, Madison, Wisconsin, USA %D 1998 %E Koza, John R. %E Banzhaf, Wolfgang %E Chellapilla, Kumar %E Deb, Kalyanmoy %E Dorigo, Marco %E Fogel, David B. %E Garzon, Max H. %E Goldberg, David E. %E Iba, Hitoshi %E Riolo, Rick %I Morgan Kaufmann %K Computing DNA %P 735--744 %T Molecular Algorithms for Efficient and Reliable DNA Computing %U http://citeseer.ist.psu.edu/91216.html %X Two new molecular algorithms are presented that are designed for the improvement of efficiency and reliability of DNA computing. The first algorithm introduces an evolutionary cycle to guide chemical reactions of DNA molecules. The second molecular algorithm extends the first one by adding another evolutionary loop for optimizing encodings of the problem instance. Just as genetic programming is a method for programming conventional computers by means of natural evolution, our approach, which might be called molecular programming, provides a method for programming biocomputers by means of artificial evolution. Simulations have been performed with the Hamiltonian path problem to verify the positive effect of the presented molecular algorithms on the reliability and efficiency of DNA computing. %@ 1-55860-548-7

@inproceedings{zhang:1998:maerDNAc, abstract = {Two new molecular algorithms are presented that are designed for the improvement of efficiency and reliability of DNA computing. The first algorithm introduces an evolutionary cycle to guide chemical reactions of DNA molecules. The second molecular algorithm extends the first one by adding another evolutionary loop for optimizing encodings of the problem instance. Just as genetic programming is a method for programming conventional computers by means of natural evolution, our approach, which might be called molecular programming, provides a method for programming biocomputers by means of artificial evolution. Simulations have been performed with the Hamiltonian path problem to verify the positive effect of the presented molecular algorithms on the reliability and efficiency of DNA computing.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {University of Wisconsin, Madison, Wisconsin, USA}, author = {Zhang, Byoung-Tak and Shin, Soo-Yong}, biburl = {https://www.bibsonomy.org/bibtex/28befc94f52ade335ac46790becf96245/brazovayeye}, booktitle = {Genetic Programming 1998: Proceedings of the Third Annual Conference}, editor = {Koza, John R. and Banzhaf, Wolfgang and Chellapilla, Kumar and Deb, Kalyanmoy and Dorigo, Marco and Fogel, David B. and Garzon, Max H. and Goldberg, David E. and Iba, Hitoshi and Riolo, Rick}, interhash = {a2e348b4a27f97f36586a7d21e0580a2}, intrahash = {8befc94f52ade335ac46790becf96245}, isbn = {1-55860-548-7}, keywords = {Computing DNA}, month = {22-25 July}, notes = {GP-98}, pages = {735--744}, publisher = {Morgan Kaufmann}, publisher_address = {San Francisco, CA, USA}, timestamp = {2008-06-19T17:55:18.000+0200}, title = {Molecular Algorithms for Efficient and Reliable {DNA} Computing}, url = {http://citeseer.ist.psu.edu/91216.html}, year = 1998 }