Bibliography

[Altenberg 1994]

L. Altenberg. The evolution of evolvability in genetic programming. In K. Kinnear, Jr, editor, Advances in Genetic Programming. MIT Press, 1994.

[Andre and Teller 1996]

D. Andre and A. Teller. A study in program response and the negative effects of introns in genetic programming. In J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, editors, Proceedings of Genetic Programming 1996: Proceedings of the First Annual Conference, pages 12-20, Stanford, USA, 1996.

[Angeline 1994]

P. Angeline. Genetic programming and emergent intelligence. In K. Kinnear, Jr, editor, Advances in Genetic Programming. MIT Press, 1994.

[Angeline 1997]

P. Angeline. Subtree crossover: Building block engine or macromutation? In John R Koza, Kalyanmoy Deb, Marco Dorigo, David B Fogel, Max Garzon, Hitoshi Iba, and Rick L Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, GP97, pages 240-248. Morgan Kaufmann, 1997.

[Angeline 1998a]

P. Angeline. Multiple interacting programs: A representation for evolving complex behaviors. Cybernetics and Systems, 29 (8): 779-806, 1998a.

[Angeline 1998b]

P. Angeline. Subtree crossover causes bloat. In Proceedings of the 1998 Conference on Genetic Programming (GP98), 1998b.

[Azad and Ryan 2003]

R. Muhammad Atif Azad and C. Ryan. Structural emergence with order independent representations. In E. Cantu-Paz et al., editor, Proceedings of the 2003 Genetic and Evolutionary Computation Conference, GECCO 2003, volume 2724 of Lecture Notes in Computer Science, pages 1626-1638. Springer-Verlag, 2003.

[Bagley 1967]

J. Bagley. The Behaviour of Adaptive Systems Which Employ Genetic and Correlation Algorithms. PhD thesis, University of Michigan, 1967.

[Banzhaf et al. 1998]

W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone. Genetic programming: An introduction. Morgan Kaufmann, San Francisco, 1998.

[Barreau 2002]

G. Barreau. The evolutionary consequences of redundancy in natural and artificial genetic codes. PhD thesis, University of Sussex, Brighton, UK, May 2002.

[Battail 2003]

G. Battail. An engineer's view on genetic information and biological evolution. In Proceedings of the Fifth International Workshop on Information Processing in Cells and Tissues, (also to appear in BioSystems), September 2003.

[Bedau and Packard 2003]

M. A. Bedau and N. H. Packard. Evolution of evolvability via adaptation of mutation rates. BioSystems, 69: 143-162, 2003.

[Bignone et al. 1997]

F. A. Bignone, R. Livi, and M. Propato. Complex evolution in genetic networks. Europhysics Letters, 40 (5): 497-502, December 1997.

[Blickle and Thiele 1994]

T. Blickle and L. Thiele. Genetic programming and redundancy. In J. Hopf, editor, Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI-94, Saarbrücken), pages 33-38. Max-Planck-Institut für Informatik, 1994.

[Boers and Kuiper 1992]

E. Boers and H. Kuiper. Biological metaphors and the design of modular neural networks. Master's thesis, Leiden University, Department of Computer Science and Department of Experimental and Theoretical Psychology, 1992.

[Bornholdt and Rohlf 2000]

S. Bornholdt and T. Rohlf. Topological evolution of dynamical networks: Global criticality from local dynamics. Physical Review Letters, 84 (26): 6114-6117, June 2000.

[Bornholdt and Sneppen 1998]

S. Bornholdt and K. Sneppen. Neutral mutations and punctuated equilibrium in evolving genetic networks. Physical Review Letters, 81 (1): 236-239, July 1998.

[Bray and Lay 1994]

D. Bray and S. Lay. Computer simulated evolution of a network of cell-signalling molecules. Biophysical Journal, 66: 972-977, 1994.

[Bray 1995]

D. Bray. Protein molecules as computational elements in living cells. Nature, 376: 307-312, 1995.

[Brown and Brown 2002]

T. A. Brown and A. Brown. Genomes. John Wiley and Sons, 2nd edition, 2002.

[Chiva and Tarroux 1995]

E. Chiva and P. Tarroux. Evolution of biological regulation networks under complex environmental constraints. Biological Cybernetics, 73: 323-333, 1995.

[Coello et al. 2002]

C. Coello, A. Christiansen, and A. Hernández-Aguirre. Use of evolutionary techniques to automate the design of combinational circuits. International Journal of Smart Engineering System Design, 2 (4): 299-314, June 2002.

[Collingwood et al. 1996]

E. Collingwood, D. Corne, and P. Ross. Useful diversity via multiploidy. In Proceedings of the IEEE International Conference on Evolutionary Computing, pages 810-813, 1996.

[Conrad 1979]

M. Conrad. Bootstrapping on the adaptive landscape. BioSystems, 11: 167-182, 1979.

[Conrad 1985]

M. Conrad. The mutation-buffering concept of biomolecular structure. Journal of Bioscience, 8: 669-679, 1985.

[Conrad 1990]

M. Conrad. The geometry of evolution. BioSystems, 24: 61-81, 1990.

[Cramer 1985]

N. Cramer. A representation for the adaptive generation of simple sequential programs. In J. Grefenstette, editor, Proceedings of the International Conference on Genetic Algorithms and their Applications, pages 183-187, 1985.

[Darwin 1859]

C. Darwin. On the Origin of Species by Means of Natural Selection, or the Preservation of Favoured Races in the Struggle for Life. John Murray, London, 1859.

[Dasgupta and McGregor 1992a]

D. Dasgupta and D. McGregor. Engineering optimizations using the structured genetic algorithm. In Proceedings of the 1992 European Conference on Artificial Intelligence, ECAI-92, pages 608-609, 1992a.

[Dasgupta and McGregor 1992b]

D. Dasgupta and D. McGregor. Non-stationary function optimization using the structured genetic algorithm. In Proceedings of Parallel Problem Solving from Nature II, PPSN-2, pages 145-154, 1992b.

[Dasgupta and McGregor 1993]

D. Dasgupta and D. McGregor. sga: A structured genetic algorithm. Technical Report IKBS-11-93.ps.Z, Department of Computer Science, University of Strathclyde, April 1993.

[Dawkins 1976]

R. Dawkins. The Selfish Gene. Oxford University Press, 1976.

[Dawkins 1989]

R. Dawkins. The evolution of evolvability. In C. Langton, editor, Artificial Life: The proceedings of an interdisciplinary workshop on the synthesis and simulation of living systems, pages 201-220. Addison-Wesley, 1989.

[Downing 2001]

K. L. Downing. Reinforced genetic programming. Genetic Programming and Evolvable Machines, 2 (3): 259-288, 2001.

[Downing 2003]

K. L. Downing. Developmental models for emergent computation. In A. Tyrrell, P. Haddow, and J. Torresen, editors, Proceedings of the Fifth International Conference on Evolvable Systems, ICES2003, volume 2606 of Lecture Notes in Computer Science, pages 105-116. Springer-Verlag, 2003.

[Ebner et al. 2001]

M. Ebner, M. Shackleton, and R. Shipman. How neutral networks influence evolvability. Complexity, 7 (2): 19-33, 2001.

[European Bioinformatics Institute 2000]

European Bioinformatics Institute. Database of functional networks in living organisms. http://www.ebi.ac.uk/research/pfmp/, 2000.

[Ferreira 2001]

C. Ferreira. Gene expression programming: A new adaptive algorithm for solving problems. Complex Systems, 13 (2): 87-129, 2001.

[Fisher et al. 1999]

M. J. Fisher, R. C. Paton, and K. Matsuno. Intracellular signalling proteins as `smart' agents in parallel distributed processes. BioSystems, 50: 159-171, 1999.

[Fogel et al. 1966]

L. Fogel, A. Owens, and M Walsh. Artificial intelligence through simulated evolution. Wiley, 1966.

[Forrest and Mitchell 1993]

S. Forrest and M. Mitchell. Relative building-block fitness and the building-block hypothesis. In D. Whitley, editor, Foundations of Genetic Programming 2. Morgan Kaufmann, 1993.

[Forst and Schulten 1999]

C. Forst and K. Schulten. Evolution of metabolisms: A new method for the comparison of metabolic pathways using genomics information. In Proceedings of the third annual international conference on Computational molecular biology, pages 174-181. ACM, April 1999.

[Francone et al. 1999]

F. Francone, M. Conrads, W. Banzhaf, and P. Nordin. Homologous crossover in genetic programming. In W. Banzhaf, J. Daida, A. Eiben, M. Garzon, V. Honavar, M. Jakiela, and R. Smith, editors, Proceedings of the 1999 Genetic and Evolutionary Computation Conference, GECCO`99, pages 1021-1026. Morgan Kaufmann, 1999.

[Friedberg 1958]

R. Friedberg. A learning machine, part I. IBM Journal of Research and Development, 2: 2-13, 1958.

[Gilbert 1978]

W. Gilbert. Why genes in pieces? Nature, 271: 501, 1978.

[Goldberg et al. 1993]

D. E. Goldberg, K. Deb, H. Kargupta, and H. George. Rapid accurate optimization of difficult problems using fast messy genetic algorithms. In S. Forrest, editor, Proceedings of The Fifth International Conference On Genetic Algorithms. Morgan Kaufmann, 1993.

[Goldberg 1989]

D. E. Goldberg. Genetic Algorithms in Search, Optimisation and Machine Learning. Addison-Wesley, 1989.

[Gruau 1994]

F. Gruau. Neural Network Synthesis using Cellular Encoding and the Genetic Algorithm. PhD thesis, Ecole Normale Superieure de Lyon, 1994.

[Haddow et al. 2001]

P. Haddow, G. Tufte, and P. van Remortel. Shrinking the genotype: L-systems for evolvable hardware. In Proceedings of the Fourth International Conference on Evolvable Systems, ICES2001, volume 2210 of Lecture Notes in Computer Science, pages 128-139. Springer-Verlag, 2001.

[Hansen 2003a]

J. V. Hansen. Genetic programming experiments with standard and homologous crossover methods. Genetic Programming and Evolvable Machines, 4: 53-66, 1 2003a.

[Hansen 2003b]

T. F. Hansen. Is modularity necessary for evolvability? Remarks on the relationship between pleiotropy and evolvability. BioSystems, 69: 83-94, 2003b.

[Harik 1997]

G. R. Harik. Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. PhD thesis, University of Michigan, 1997.

[Haynes et al. 1996]

T. Haynes, D. Schoenefeld, and R. Wainwright. Type inheritance in strongly typed genetic programming. In P. Angeline and K. Kinnear, Jr, editors, Advances in Genetic Programming 2. MIT Press, 1996.

[Haynes 1996]

T. Haynes. Duplication of coding segments in genetic programming. Technical Report UTULSA-MCS-96-03, The University of Tulsa, 1996.

[Heinrich and Schuster 1998]

R. Heinrich and S. Schuster. The modelling of metabolic systems. Structure, control and optimality. BioSystems, 47: 61-77, 1998.

[Hirasawa et al. 2001]

K. Hirasawa, M. Okubu, J. Hu, and J. Murata. Comparison between genetic network programming (GNP) and genetic programming (GP). In J.-H. Kim, B.-T. Zhang, G. Fogel, and I. Kuscu, editors, Proceedings of the 2001 IEEE Congress on Evolutionary Computation, pages 1276-1282. IEEE Press, May 2001.

[Holland 1975]

J. H. Holland. Adaptation in Natural and Artificial Systems. MIT Press, 1975.

[Hornby 2003]

G. Hornby. Generative representations for evolving families of designs. In E. Cantu-Paz, editor, Proceedings of the 2003 Genetic and Evolutionary Computation Conference, GECCO 2003, volume 2724 of Lecture Notes in Computer Science, pages 1678-1689. Springer-Verlag, 2003.

[Huynen et al. 1996]

M. Huynen, P. Stadler, and W. Fontana. Smoothness within ruggedness: The role of neutrality in adaptation. Proceedings of the National Academy of Science (USA), 93: 397-401, 1996.

[Huynen 1996]

M. Huynen. Exploring phenotype space through neutral evolution. Journal of Molecular Evolution, 43: 165-169, 1996.

[Iba and Terao 2000]

H. Iba and M. Terao. Controlling effective introns for multi-agent learning by genetic programming. In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H-G Beyer, editors, Proceedings of the 2000 Genetic and Evolutionary Computation Conference, GECCO 2000, pages 419-426. Morgan Kaufmann, 2000.

[Igamberdiev 1999]

A. Igamberdiev. Foundations of metabolic organization: coherence as a basis for computational properties in metabolic networks. BioSystems, 50: 1-16, 1999.

[Jones 1995]

T. Jones. Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, The University of New Mexico, 1995.

[Karp and Mavrovouniotis 1994]

P. D. Karp and M. L. Mavrovouniotis. Representing, analyzing and synthesizing biochemical pathways. IEEE Expert, 9 (2): 11-21, 1994.

[Karp and Paley 1994]

P. D. Karp and S. M. Paley. Representations of metabolic knowledge: Pathways. In R. Altman, D. Brutlag, P. Karp, R. Lathrop, and D. Searls, editors, Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, Menlo Park, CA, 1994. AAAI Press.

[Karp 1999]

P. D. Karp. Ecocyc: The resource and the lessons learned. In S. Letovsky, editor, Bioinformatics Databases and Systems, pages 47-62. Kluwer Academic Publishers, 1999.

[Katagiri et al. 2000]

H. Katagiri, K. Hirasawa, and J. Hu. Genetic network programming - application to intelligent agents. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pages 3829-3834. IEEE Press, 2000.

[Kauffman 1969]

S. A. Kauffman. Metabolic stability and epigenesis in randomly constructed genetic nets. Journal of Theoretical Biology, 22: 437-467, 1969.

[Keijzer et al. 2001]

M. Keijzer, C. Ryan, M. O'Neill, M. Cattolico, and V. Babovic. Ripple crossover in genetic programming. In J. Miller, M. Tomassini, P. Lanzi, C. Ryan, A. Tettamanzi, and W. Langdon, editors, Proceedings of the 2001 European Genetic Programming Conferences, EuroGP 2001, volume 2038 of Lecture Notes in Computer Science, pages 74-86. Springer-Verlag, 2001.

[Kimura 1983]

M. Kimura. The Neutral Theory of Molecular Evolution. Cambridge University Press, 1983.

[Kirschner and Gerhart 1998]

M. Kirschner and J. Gerhart. Evolvability. Proceedings of the National Academy of Science (USA), 95: 8420-8427, July 1998.

[Knowles and Watson 2002]

J. D. Knowles and R. A. Watson. On the utility of redundant encodings in mutation-based evolutionary search. In J. J. Merelo, P. Adamidis, H.-G. Beyer, J.-L. Fernandez-Villacanas, and H.-P. Schwefel, editors, Proceedings of Parallel Problem Solving from Nature (PPSN) VII, pages 88-98. Springer-Verlag, 2002.

[Koza 1992]

John Koza. Genetic programming: on the programming of computers by means of natural selection. MIT Press, 1992.

[Koza et al. 1999]

J. Koza, F. Bennett, III, D. Andre, and M. Keane. Genetic programming: Biologically inspired computation that creatively solves non-trivial problems. In L. Landweber, E. Winfree, R. Lipton, and S. Freeland, editors, Proceedings of DIMACS Workshop on Evolution as Computation. Princeton University, 1999.

[Koza 1994]

J. Koza. Genetic programming II: automatic discovery of reusable programs. MIT Press, 1994.

[Koza 1995]

J. Koza. Evolving the architecture of a multi-part program in genetic programming using architecture-altering operations. In A. Sebald and L. Fogel, editors, Proceedings of the Fourth Annual Conference on Evolutionary Programming. MIT Press, 1995.

[Koza 2001]

J. Koza. Reverse engineering of metabolic pathways from observed data using genetic programming. In Proceedings of the Sixth Pacific Symposium on Biocomputing. World Scientific press, 2001.

[Langdon and Poli 1997]

W. Langdon and R. Poli. Fitness causes bloat. In P. K. Chawdhry, R. Roy, and R. K. Pant, editors, Soft Computing in Engineering Design and Manufacturing, pages 13-22. Springer, 1997.

[Langdon and Poli 1998]

W. Langdon and R. Poli. Why "building blocks" don't work on parity problems. Technical Report CSRP-98-17, School of Computer Science, University of Birmingham, July 1998.

[Langdon and Poli 2002]

W. Langdon and R. Poli. Foundations of Genetic Programming. Springer, 2002.

[Langdon 1995]

W. Langdon. Evolving data structures using genetic programming. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference. Morgan Kaufman, 1995.

[Langdon 1999]

W. Langdon. Size fair tree crossovers. In Netherlands/Belgium Conference on Artificial Intelligence, BNAIC 1999, 1999.

[Langdon 2000a]

W. Langdon. Quadratic bloat in genetic programming. In D. Whitley, D. Goldberg, and E. Cantu-Paz, editors, Proceedings of the 2000 Genetic and Evolutionary Computation Conference, pages 451-458. Morgan Kaufmann, 2000a.

[Langdon 2000b]

W. Langdon. Size fair and homologous tree genetic programming crossovers. Genetic Programming and Evolvable Machines, 1 (1/2): 95-119, 2000b.

[Lehman and Parr 1976]

M. Lehman and F. Parr. Program evolution and its impact on software engineering. In Proceedings of the 1976 International Conference on Software Engineering, ICSE 1976, pages 350-357, 1976.

[Levenick 1991]

J. R. Levenick. Inserting introns improves genetic algorithm success rate: Taking a cue from biology. In R. Belew and L. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 123-127. Morgan Kaufmann, 1991.

[Levenick 1999]

J. Levenick. Swappers: Introns promote flexibility, diversity and invention. In Proceedings of the 1999 Genetic and Evolutionary Computation Conference, GECCO`99, volume 1, pages 361-368, 1999.

[Lewin 2000]

B. Lewin. Genes VII. Oxford University Press, 2000.

[Lobo et al. 1997]

F. G. Lobo, K. Deb, D. E. Goldberg, G. R. Harik, and L. Wang. Compressed introns in a linkage learning genetic algorithm. IlliGAL report no. 97010, University of Illinois, December 1997.

[Lodish et al. 2003]

H. Lodish, A. Berk, S. Zipursky, P. Matsudaira, D. Baltimore, J. Darnell, and L. Zipursky. Molecular Cell Biology. W. H. Freeman and Co., 5th edition, 2003.

[Lones and Tyrrell 2001a]

M. A. Lones and Andy M. Tyrrell. Pathways into genetic programming. In C. Ryan, editor, Proceedings of the 2001 Genetic and Evolutionary Computation Conference, Graduate Workshop, 2001a.

[Lones and Tyrrell 2003a]

M. A. Lones and Andy M. Tyrrell. Modelling biological evolvability: Implicit context and variation filtering in enzyme genetic programming. BioSystems, 2003a. To Appear, special issue on the proceedings of the 2003 information processing in cells and tissues workshop.

[Lones and Tyrrell 2001b]

M. A. Lones and A. M. Tyrrell. Biomimetic representation in genetic programming. In H. Kargupta, editor, Proceedings of the 2001 Genetic and Evolutionary Computation Conference, Computation in Gene Expression Workshop, pages 199-204, July 2001b.

[Lones and Tyrrell 2001c]

M. A. Lones and A. M. Tyrrell. Enzyme genetic programming. In J.-H. Kim, B.-T. Zhang, G. Fogel, and I. Kuscu, editors, Proceedings of the 2001 Congress on Evolutionary Computation, volume 2, pages 1183-1190. IEEE Press, May 2001c.

[Lones and Tyrrell 2002a]

M. A. Lones and A. M. Tyrrell. Biomimetic representation in genetic programming enzyme. Genetic Programming and Evolvable Machines, 3 (2): 193-217, June 2002a.

[Lones and Tyrrell 2002b]

M. A. Lones and A. M. Tyrrell. Crossover and bloat in the functionality model of enzyme genetic programming. In Proceedings of the 2002 World Congress on Computational Intelligence. IEEE Press, 2002b.

[Lones and Tyrrell 2003b]

M. A. Lones and A. M. Tyrrell. Enzyme genetic programming. In M. Amos, editor, Cellular Computing, Genomics and Bioinformatics Series. Oxford University Press, 2003b. (To appear).

[Lones 1999]

M. A. Lones. Evolving line labellings. MEng project report, University of York, Department of Computer Science, 1999.

[Luke et al. 1999]

S. Luke, S. Hamahashi, and H. Kitano. "Genetic" Programming. In Wolfgang Banzhaf, Jason Daida, Agoston E. Eiben, Max H. Garzon, Vasant Honavar, Mark Jakiela, and Robert E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'99). Morgan Kaufmann, 1999.

[Luke and Spector 1997]

S. Luke and L. Spector. A comparison of crossover and mutation in genetic programming. In J. Koza, K. Deb, M. Dorigo, D. Fogel, M. Garzon, H. Iba, and Riolo R., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference (GP97), pages 240-248. Morgan Kaufmann, 1997.

[Luke and Spector 1998]

S. Luke and L. Spector. A revised comparison of crossover and mutation in genetic programming. In J. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. Fogel, M. Garzon, D. Goldberg, H. Iba, and R. Riolo, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference. Morgan Kaufmann, 1998.

[Luke 2000]

S. Luke. Code growth is not caused by introns. In Proceedings of the 2000 Genetic and Evolutionary Computation Conference, Las Vegas, 2000.

[Lyubarev and Kurganov 1997]

A. E. Lyubarev and B. I. Kurganov. Origin of biochemical organization. BioSystems, 42: 103-110, 1997.

[Marijuán 1994]

P. C. Marijuán. Enzymes, automata and artificial cells. In Ray C. Paton, editor, Computing with Biological Metaphors, chapter 5, pages 50-68. Chapman and Hall, 1994.

[Marijuán 1995]

P. C. Marijuán. Enzymes, artificial cells and the nature of biological information. BioSystems, 35: 167-170, 1995.

[McPhee and Miller 1995]

N. F. McPhee and J. D. Miller. Accurate replication in genetic programming. In L. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 303-309. Morgan Kaufmann, 1995.

[McPhee and Poli 2001]

N. F. McPhee and R. Poli. A schema theory analysis of the evolution of size in genetic programming with linear representations. In J. Miller, M. Tomassini, P. Lanzi, C. Ryan, A. Tettamanzi, and W. Langdon, editors, Proceedings of EuroGP 2001, pages 108-125. Springer-Verlag, 2001.

[Mendel 1965]

G. Mendel. Experiments in Plant Hybridisation. Oliver and Boyd, London, 1965.

[Michal 1998]

G. Michal. On representation of metabolic pathways. BioSystems, 47: 1-7, 1998.

[Michal 1999]

G. Michal. Biochemical pathways. John Wiley and Sons, Inc., 1999.

[Miller et al. 2000]

J. Miller, D. Job, and V. Vassilev. Principles in the evolutionary design of digital circuits - part I. Genetic Programming and Evolvable Machines, 1: 7-36, April 2000.

[Miller and Thomson 2000]

J. Miller and P. Thomson. Cartesian genetic programming. In Riccardo Poli, Wolfgang Banzhaf, William B. Langdon, Julian F. Miller, Peter Nordin, and Terence C. Fogarty, editors, Third European Conference on Genetic Programming, volume 1802 of Lecture Notes in Computer Science. Springer, 2000.

[Miller and Thomson 2003]

J. Miller and P. Thomson. A developmental method for growing graphs and circuits. In A. Tyrrell, P. Haddow, and J. Torresen, editors, Proceedings of the Fifth International Conference on Evolvable Systems, ICES2003, volume 2606 of Lecture Notes in Computer Science, pages 93-104. Springer-Verlag, 2003.

[Miller 2001]

J. Miller. What bloat? Cartesian genetic programming on boolean problems. In Proceedings of the 2001 Genetic and Evolutionary Computation Conference, Late Breaking Papers, pages 295-302, July 2001.

[Montana 1994]

D. Montana. Strongly typed genetic programming. BBN technical report, Bolt Beranek and Newman, Inc., 10 Moulton Street, Cambridge, MA 02138, USA, 1994.

[Montana 1995]

D. Montana. Strongly typed genetic programming. Evolutionary Computation, 3 (2), 1995.

[Nehaniv 2003]

C. L. Nehaniv. Editorial for special issue on evolvability. BioSystems, 69: 77-81, 2003.

[Nordin and Banzhaf 1995]

P. Nordin and W. Banzhaf. Complexity compression and evolution. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the sixth international conference (ICGA95), pages 310-317. Morgan Kaufmann, San Francisco, 1995.

[Nordin et al. 1996]

P. Nordin, F. Francone, and W. Banzhaf. Explicitly defined introns and destructive crossover in genetic programming. In P. Angeline and Jr. K. Kinnear, editors, Advances in Genetic Programming 2, chapter 6, pages 111-134. MIT Press, Cambridge, 1996.

[Nordin 1994]

P. Nordin. A compiling genetic programming system that directly manipulates the machine code. In Kenneth E. Kinnear, Jr., editor, Advances in Genetic Programming, chapter 14, pages 311-331. MIT Press, 1994.

[Ohno 1970]

S. Ohno. Evolution by gene duplication. Springer-Verlag, 1970.

[Oltean and Dumitrescu 2002]

M. Oltean and D. Dumitrescu. Multi expression programming. Unpublished. Manuscript available from http://www.mep.cs.ubbcluj.ro/papers.htm, 2002.

[Page and Holmes 1998]

R. D. M. Page and E. C. Holmes. Molecular Evolution: A phylogenetic approach. Blackwell Science, 1998.

[Pepper 2003]

J. W. Pepper. The evolution of evolvability in genetic linkage patterns. BioSystems, 69: 115-126, 2003.

[Poli and Langdon 1997]

R. Poli and W. Langdon. Genetic programming with one-point crossover. In P. Chawdhry, R. Roy, and R. Pant, editors, Soft Computing in Engineering Design and Manufacturing (Conference proceedings), pages 180-189. Springer-Verlag, 1997.

[Poli and Langdon 1998]

R. Poli and W. Langdon. On the ability to search the space of programs of standard, one-point and uniform crossover in genetic programming. Technical Report CSRP-98-7, School of Computer Science, The University of Birmingham, 1998.

[Poli 1997]

R. Poli. Evolution of graph-like programs with parallel distributed genetic programming. In T. Bäck, editor, Proceedings of Seventh International Conference on Genetic Algorithms, pages 346-353. Morgan Kaufmann, July 1997.

[Poole et al. 2003]

A. M. Poole, M. J. Philips, and D. Penny. Prokaryote and eukaryote evolvability. BioSystems, 69: 163-186, 2003.

[Raich and Ghaboussi 1997]

A. Raich and J. Ghaboussi. Implicit redundant representation in genetic algorithms. Evolutionary Computation, 5 (3): 277-302, 1997.

[Rechenberg 1973]

I. Rechenberg. Evolutionstrategie: optimierung technisher systeme nach prinzipien der biologischen evolution. Frommann-Hoolzboog Verlag, 1973.

[Reddy et al. 1996]

V. Reddy, M. Liebman, and M. Mavrovouniotis. Qualitative analysis of biochemical reaction systems. Computers in biology and medicine, 26 (1): 9-24, 1996.

[Reddy et al. 1993]

V. Reddy, M. Mavrovouniotis, and M. Liebman. Petri net representations in metabolic pathways. In L. Hunter, editor, Proceedings of the first international conference on intelligent systems for molecular biology. MIT Press, 1993.

[Rosca and Ballard 1994]

J. Rosca and D. Ballard. Hierarchical self-organisation in genetic programming. In Proceedings of the eleventh international conference on machine learning. Morgan Kauffman, 1994.

[Rosca and Ballard 1995]

J. Rosca and D. Ballard. Causality in genetic programming. In L. Eshelman, editor, Genetic algorithms: proceedings of the sixth international conference. Morgan Kauffman, 1995.

[Rosca and Ballard 1996]

J. Rosca and D. Ballard. Discovery of subroutines in genetic programming. In P. Angeline and K. Kinnear, editors, Advances in genetic programming: volume 2. MIT Press, 1996.

[Rosenberg 1967]

R. Rosenberg. Simulation of Genetic Populations with Biochemical Properties. PhD thesis, 1967.

[Rothlauf and Goldberg 2002]

F. Rothlauf and D. E. Goldberg. Redundant representations in evolutionary computation. IlliGAL report no. 2002025, University of Illinois, December 2002.

[Ryan et al. 2002]

C. Ryan, A. Azad, A. Sheahan, and M. O'Neill. No coersion and no prohibition, a position independent encoding scheme for evolutionary algorithms - the Chorus system. In Proceedings of the 2002 European Conference on Genetic Programming (EuroGP 2002), pages 131-141. Springer, 2002.

[Ryan et al. 1998]

C. Ryan, J. J. Collins, and M. O'Neill. Grammatical evolution: Evolving programs for an arbitrary language. In W. Banzhaf, editor, First European Workshop on Genetic Programming, volume 1391 of Lecture Notes in Computer Science. Springer, April 1998.

[Schaffer and Morishima 1987]

J. Schaffer and A. Morishima. An adaptive crossover distribution mechanism for genetic algorithms. In Proceedings of the Second International Conference on Genetic Algorithms and Their Applications, 1987.

[Schilling et al. 1999]

C. Schilling, S. Schuster, B. Palsson, and R. Heinrich. Metabolic pathway analysis: Basic concepts and scientific applications in the post-genomic era. Biotechnology Progress, 15: 296-303, 1999.

[Schuster 2000]

P. Schuster. Molecular insights into evolution of phenotypes. In J. Crutchfield and P. Schuster, editors, Evolutionary dynamics - Exploring the interplay of accident, selection, neutrality and function. Oxford University Press, 2000.

[Scott and Pawson 2000]

John D. Scott and Tony Pawson. Cell communication: The inside story. Scientific American, 282 (6): 54-61, June 2000.

[Shackleton et al. 2000]

M. Shackleton, R. Shipman, and M. Ebner. An investigation of redundant genotype-phenotype mappings and their role in evolutionary search. In Proceedings of the 2000 Congress on Evolutionary Computation, volume 1, pages 493-500. IEEE Press, 2000.

[Shimeld 1999]

S. M. Shimeld. Gene function, gene networks and the fate of duplicated genes. Seminars in Cell and Developmental Biology, 10: 549-553, 1999.

[Shipman et al. 2000]

R. Shipman, M. Shackleton, and I. Harvey. The use of neutral genotype-phenotype mappings for improved evolutionary search. BT Technology Journal, 18 (4): 103-111, October 2000.

[Shipman 1999]

R. Shipman. Genetic redundancy: Desirable or problematic for evolutionary adaptation? In A. Dobnikar, N. C. Steele, D. W. Pearson, and R. F. Albrecht, editors, Proceedings of the Fourth International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA `99), pages 337-344. Springer-Verlag, April 1999.

[Silva et al. 1999]

A. Silva, Ana N., and E. Costa. Evolving genetic controllers for autonomous agents using genetically programmed networks. In Riccardo Poli, Peter Nordin, William B. Langdon, and Terence C. Fogarty, editors, Proceedings of the second European workshop on genetic programming, EuroGP'99, volume 1598 of Lecture Notes in Computer Science, pages 255-269. Springer-Verlag, May 1999.

[Smith 2002]

J. Smith. On appropriate adaptation levels for the learning of gene linkage. Genetic Programming and Evolvable Machines, 3 (2): 129-155, June 2002.

[Smith and Harries 1998]

P.W.H. Smith and K. Harries. Code growth, explicitly defined introns and alternative selection schemes. Evolutionary Computation, 6 (4): 339-360, 1998.

[Smith and Goldberg 1992]

R. Smith and D. Goldberg. Diploidy and dominance in artificial genetic search. Complex Systems, 6 (3): 251-286, 1992.

[Smith et al. 2003]

T. Smith, P. Husbands, and M. O'Shea. Local evolvability of statistically neutral GasNet robot controllers. BioSystems, 69: 223-244, 2003.

[Somogyi and Sniegoski 1996]

R. Somogyi and C. Sniegoski. Modeling the complexity of genetic networks: Understanding multigenetic and pleiotropic regulation. Complexity, 1 (6): 45-63, 1996.

[Soule et al. 1996]

T. Soule, J. A. Foster, and J. Dickinson. Code growth in genetic programming. In John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 215-213. MIT Press, July 1996.

[Spector and Luke 1996]

L. Spector and L. Luke. Cultural transmission of information in genetic programming. In J. Koza, D. Goldberg, D. Fogel, and R. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference. MIT Press, 1996.

[Spector and Robinson 2002]

L. Spector and A. Robinson. Genetic programming and autoconstructive evolution with the push programming language. Genetic Programming and Evolvable Machines, 3: 7-40, 2002.

[Spector 2001]

L. Spector. Autoconstructive evolution: Push, PushGP, and Pushpop. In L. Spector, E. Goodman, A. Wu, W. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke, editors, Proceedings of the 2001 Genetic and Evolutionary Computation Conference. Morgan Kaufmann, 2001.

[Stephens and Waelbroeck 1999]

C. R. Stephens and H. Waelbroeck. Codon bias and mutability in HIV sequences. Journal of Molecular Evolution, 48: 390-397, 1999.

[Sutherland 1972]

E. W. Sutherland. Studies on the mechanism of hormone action. Science, 177: 401-408, 1972.

[Suzuki 2003]

H. Suzuki. An example of design optimization for high evolvability: string rewriting grammar. BioSystems, 69: 211-222, 2003.

[Teller and Veloso 1996]

A. Teller and M. Veloso. PADO: A new learning architecture for object recognition. In K. Ikeuchi and M. Veloso, editors, Symbolic Visual Learning, pages 81-116. Oxford University Press, 1996.

[Teller 1994]

A. Teller. The evolution of mental models. In K. Kinnear, Jr, editor, Advances in Genetic Programming. MIT Press, 1994.

[Teller 1996]

A. Teller. Evolving programmers: The co-evolution of intelligent recombination operators. In P. Angeline and K. Kinnear, Jr, editors, Advances in Genetic Programming 2. MIT Press, 1996.

[Teller 1999]

A. Teller. The internal reinforcement of evolving algorithms. In L. Spector, W. Langdon, U.-M. O'Reilly, and P. Angeline, editors, Advances in Genetic Programming 3, pages 325-354. MIT Press, 1999.

[Toussaint and Igel 2002]

M. Toussaint and C. Igel. Neutrality: A necessity for self-adaptation. In Proceedings of the 2002 World Congress on Computational Intelligence, pages 1354-1359. IEEE Press, 2002.

[Vassilev et al. 1999]

V. Vassilev, J. Miller, and T. Fogarty. On the nature of two-bit multiplier landscapes. In A. Stoica, D. Keymeulen, and J. Lohn, editors, The First NASA/DoD Workshop on Evolvable Hardware, pages 36-45. IEEE Computer Society, July 1999.

[Vassilev and Miller 2000]

V. Vassilev and J. Miller. The advantages of landscape neutrality in digital circuit evolution. In J.Miller, editor, Evolvable Systems: From Biology to Hardware (ICES2000), volume 1801 of Lecture Notes in Computer Science, pages 252-263. Springer, April 2000.

[Volkert and Conrad 1998]

L. G. Volkert and M. Conrad. The role of weak interactions in biological systems: the dual dynamics model. Journal of Theoretical Biology, 193: 287-306, 1998.

[Volkert 2003]

L. G. Volkert. Enhancing evolvability with mutation buffering mediated through multiple weak interactions. BioSystems, 69: 127-142, 2003.

[Wächtershäuser 1990]

G. Wächtershäuser. Evolution of the first metabolic cycles. Evolution, 87: 200-204, January 1990.

[Wagner and Altenberg 1996]

G. P. Wagner and L. Altenberg. Complex adaptations and the evolution of evolvability. Evolution, 50 (3): 967-976, 1996.

[Walker and Murphy 2000]

R. Walker and G. Murphy. Implicit context: Easing software evolution and reuse. In Foundations of Software Engineering, pages 69-78. 2000.

[Weicker and Weicker 2001]

K. Weicker and N. Weicker. Burden and benefits of redundancy. In W. Martin and W. Spears, editors, Foundations of Genetic Algorithms 6, pages 313-333. Morgan Kaufmann, 2001.

[Wolpert and Macready 1995]

D. Wolpert and W. Macready. No free lunch theorems for search. Working paper sfi-tr-95-02-010, Santa Fe Institute, 1995.

[Wuensche 1998]

A. Wuensche. Genomic regulation modeled as a network with basins of attraction. In Proceedings of the 1998 Pacific Symposium on Biocomputing. World Scientific, 1998.

[Wu and Garibay 2002]

A. S. Wu and I. Garibay. The proportional genetic algorithm: Gene expression in a genetic algorithm. Genetic Programming and Evolvable Machines, 3 (2): 157-192, June 2002.

[Wu and Lindsay 1995]

A. S. Wu and R. K. Lindsay. Empirical studies of the genetic algorithm with non-coding segments. Evolutionary Computation, 3: 121-148, 1995.

[Wu and Lindsay 1996a]

A. S. Wu and R. K. Lindsay. A comparison of the fixed and floating building block representation in the genetic algorithm. Evolutionary Computation, 4 (2): 169-193, 1996a.

[Wu and Lindsay 1996b]

A. S. Wu and R. K. Lindsay. A survey of intron research in genetics. In Proceedings of the Fourth International Conference on Parallel Problem Solving from Nature, September 1996b.

[Yu and Clack 1998]

T. Yu and C. Clack. Recursion, lambda abstractions and genetic programming. In Genetic Programming 1998: Proceedings of the Third Annual Conference, 1998.

[Yu and Miller 2002]

T. Yu and J. Miller. Finding needles in haystacks is not hard with neutrality. In Proceedings of the 2002 European Conference on Genetic Programming, EuroGP 2002, pages 13-25, 2002.

[Yu and Milller 2001]

T. Yu and J. Milller. Neutrality and the evolvability of Boolean function landscape. In Proceedings of the 2001 European Genetic Programming Conference, EuroGP 2001, pages 204-217, 2001.

[Yu 1999]

T. Yu. Structure abstraction and genetic programming. In Proceedings of the 1999 Congress on Evolutionary Computation, 1999.