Cross-fertilization between evolutionary computation and DNA-based computing

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 2, Issue , 1999, Pages 980-987

  Back, Thomas ^a,b   Kok, Joost N ^b   Rozenberg, Grzegon ^b  

^a Informatik Centrum Dortmund   (Germany)

^b Leiden Center for Natural Computing   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

DNA; POPULATION STATISTICS;

DNA-BASED COMPUTING; EVOLUTIONARY APPROACH; EXPECTED IMPROVEMENTS; EXPERIMENTAL INVESTIGATIONS; MAXIMUM CLIQUE PROBLEMS; POPULATION SIZES; PROBLEM INSTANCES; SOLUTION QUALITY;

CALCULATIONS;

EID: 84901438780     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.782529     Document Type: Conference Paper

References (34)

1. Proceedings of the Fourth IEEE Conference on Evolutionary Computation, Indianapolis, IN. IEEE Press, Piscataway, NJ, 1997.
2. L. M. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021-1024, November 1994.
3. M. Amos. DNA Computing. Phd thesis, The University of Warwick, Warwick, UK, September 1997.
4. Th. Back. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1996.
5. Th. Back and S. Khuri. An evolutionary heuristic for the maximum independent set problem. In Proceedings of the First IEEE Conference on Evolutionary Computation, pages 531-535. IEEE Press, 1994.
6. Th. Back, J. N. Kok, and G. Rozenberg. Evolutionary computation as a paradigm for DNA-based computing. In L. Landweber, E. Winfree, R. Lipton, and S. Freeland, editors, Preliminary Proceedings: DIMACS Workshop on Evolution as Computation, Princeton, January 11-12th, pages 67-88. Princeton University, Princeton, NJ, 1999.
7. J. M. Barreiro, J. Rodrigo, and A. Rodríguez-Paton. Evolutionary biomolecular computing. Romanian Journal of Information Science and Technology, 1(1):201-206, 1998.
8. I. M. Bomze, M. Pelillo, and R. Giacomini. Evolutionary approach to the maximum clique problem: Empirical evidence on a larger scale. In I. M. Bomze, editor, Developments in Global Optimization, pages 95-108. Kluwer, Amsterdam, 1997.
9. L. Castellanos, S. Leiva, J. Rodrigo, and A. Rodriguez-Paton. Molecular computation for genetic algorithms. In L. Polkowski and A. Skowron, editors, Rough Sets and Current Trends in Computing, RSCTC'98, Warsaw, June 98, volume 1424 of Lecture Notes in Artificial Intelligence, pages 91-98. Springer, Berlin, 1998.
10. J. Chen, E. Antipov, B. Lemieux, W. Cedeño, and D. H. Wood. Programming a genetic algorithm on a DNA computer. In L. Landweber, E. Winfree, R. Lipton, and S. Freeland, editors, Preliminary Proceedings: DIMACS Workshop on Evolution as Computation, Princeton, January 11-12, 1999, pages 39-49. Princeton University, Princeton, NJ, 1999.
11. R. Deaton, R. C. Murphy, J. A. Rose, M. Garzon, D. R. Franceschetti, and Jr. S. E. Stevens. A DNA based implementation of an evolutionary search for good encodings for DNA computation. In Proceedings of the Fourth IEEE Conference on Evolutionary Computation, Indianapolis, IN [1], pages 267-271.
12. U. Feige, S. Goldwasser, S. Safra, L. Lovasz, and M. Szegedy. Approximating clique is almost NP-complete. In Proceedings of the 32nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), pages 2-12, 1991.
13. D. B. Fogel. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway, NJ, 1995.
14. M. Hagiya, M. Arita, D. Kiga, K. Sakamoto, and S. Yokoyama. Towards parallel evaluation and learning of boolean μ-formulas with molecules. In Preliminary Proceedings of the 3rd DIMACS Workshop on DNA-Based Computers, pages 105-114, 1997.
15. U. Hammel and Th. Back. Evolution strategies on noisy functions: How to improve convergence properties. In Y. Davidor, H.-P. Schwefel, and R. Manner, editors, Parallel Problem Solving from Nature - PPSN III, International Conference on Evolutionary Computation, volume 866 of Lecture Notes in Computer Science, pages 159-168. Springer, Berlin, 1994.
16. J. Hartmanis. On the weight of computations. Bulletin of the European Association for Theoretical Computer Science, 55:136-138, February 1995.
17. J. Hastad. Clique is hard to approximate within n1-ε. In Proceedings of the 37th Annual IEEE Symposium on the Foundations of Computer Science (FOCS), pages 627-636, 1996.
18. T. Head. Formal language theory and DNA: An analysis of the generative capacity of recombinant behaviors. Bulletin of Mathematical Biology, 49:737-759, 1987.
19. T. Head. Splicing systems and molecular processes. In Proceedings of the Fourth IEEE Conference on Evolutionary Computation, Indianapolis, IN [1], pages 203-205.
20. J. H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, MI, 1975.
21. L. Kari. From micro-soft to bio-soft: Computing with DNA. TUCS General Publication 6, Turku Centre for Computer Science, Turku, Finland, August 1997.
22. R. M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1972.
23. S. Khuri and Th. Back. An evolutionary heuristic for the minimum vertex cover problem. In J. Kunze and H. Stoyan, editors, KI-94 Workshops (Extended Abstracts), pages 83-84. Gesellschaft fur Informatik e. V., Bonn, 1994.
24. E. Laun and K. J. Reddy. Wet splicing systems. In Proceedings of the Third Annual Meeting on DNA Based Computers. University of Pennsylvania, 1997.
25. R. Lipton. DNA solution of hard computational problems. Science, 268:542-545, April 1995.
26. E. Marchiori. A simple heuristic based genetic algorithm for the maximum clique problem. In ACM Symposium on Applied Computing (SAC), pages 366-373, 1998.
27. B. L. Miller and D. E. Goldberg. Genetic algorithms, selection schemes, and the varying effects of noise. Evolutionary Computation, 4(2):113-132, 1996.
28. N. Morimoto, M. Arita, and A. Suyama. Solid phase DNA solution to the hamiltonian path problem. In Preliminary Proceedings of the 3rd DIMACS Workshop on DNA-Based Computers, pages 83-92, 1997.
29. Qi Ouyang, P. D. Kaplan, S. Liu, and A. Libchaber. DNA solution of the maximal clique problem. SCIENCE, 278:446-49, 1997.
30. P. M. Pardalos and J. Xue. The maximum clique problem. Journal of Global Optimization, 4:301-328, 1994.
31. G. Phaun, G. Rozenberg, and A. Salomaa. DNA Computing. Springer, Berlin, 1998.
32. J. T. Richardson, M. R. Palmer, G. Liepins, and M. Hilliard. Some guidelines for genetic algorithms with penalty functions. In Schaffer [33], pages 191-197.
33. J. D. Schaffer, editor. Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann Publishers, San Mateo, CA, 1989.
34. A. E. Smith and D. M. Tate. Genetic optimization using a penalty function. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 499-505. Morgan Kaufmann Publishers, San Mateo, CA, 1993.