Finding needles in haystacks is not hard with neutrality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2278, Issue , 2002, Pages 13-25

  Yu, Tina ^a   Miller, Julian ^b  

^a CHEVRON ENERGY TECHNOLOGY COMPANY   (United States)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; NEEDLES;

ADAPTIVE MUTATION; EVOLUTIONARY SEARCH; FITNESS LANDSCAPE; NEUTRAL NETWORK; SEARCH SPACES; SEARCH SUCCESS;

GENETIC PROGRAMMING;

EID: 84943244463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45984-7_2     Document Type: Conference Paper

References (13)

1. Altenberg, L.: The evolution of evolvability in genetic programming. In: Advances in Genetic Programming, K. E. Kinner Jr., ed. MIT Press, (1994) 47-74.
2. Ebner, M., Langguth, P., Albert, J., Shackleton, M. and Shipman, R.: On neutral networks and evolvability. In: Proceedings of the 2001 Congress on Evolutionary Computation, IEEE Press (2001) 1-8.
3. Kimura, M.: The Neutral Theory of Molecular Evolution. Cambridge Univ. Press (1983).
4. King, J. L. and Jukes, T. H.: Non-Darwinian evolution. Science Vol. 164 (1969) 788-798.
5. Koza, J. R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press (1992).
6. Kreitman, M.: The neutral theory is dead. Long live the neutral theory. BioEssays, Vol. 18 (1996) 678-682.
7. Langdon, W. B. and Poli, R.: Why “building blocks” don’t work on parity problems. Technical report number CSRP-98-17. The University of Birmingham, July 13, 1998.
8. McDonald, J. H. and Kreitman, M.: Adaptive protein evolution at the Adh locus in Drosophila. Nature Vol. 351 (1991) 652-654.
9. Miller, J. F. and Thomson, P. Cartesian genetic programming. In: Proceedings of the Third European Conference on Genetic Programming. LNCS, Vol. 1802 (2000) 121-132.
10. Ohta, T.: The nearly neutral theory of molecular evolution. In: Annual Reviews Ecology & Systematic, Vol. 23 (1992) 263-286.
11. Wilke, C. O., Wang, J. L., Ofria, C., Lenski, R. E. and Adami, C.: Evolution of digital organisms at high mutation rate leads to survival of the flattest. Nature, Vol. 412 (2001) 331-333.
12. Yu, T. and Miller, J.: Neutrality and the evolvability of Boolean function landscape. In: Proceedings of the Fourth European Conference on Genetic Programming. Springer-Verlag (2001) 204-217.
13. Yu, T.: Structure abstraction and genetic programming. In: Proceedings of the 1999 Congress on Evolutionary Computation. IEEE Press (1999) 652-659.