GEP Book   Home   News   Author   Q&A   Tutorials   Downloads   GEP Biblio   Contacts   Visit Gepsoft

C. FERREIRA In J. M. Benitez, O. Cordon, F. Hoffmann, and R. Roy, eds., Advances in Soft Computing: Engineering Design and Manufacturing, pages 257-266, Springer-Verlag, 2003. Function Finding and the Creation of Numerical Constants in Gene Expression Programming Gene Expression Programming   The phenotype of GEP individuals consists of the same kind of diagram representation used by GP. However, these complex phenotypes are encoded in simpler, linear structures of fixed length – the chromosomes. Thus, the main players in GEP are the chromosomes and the ramified structures or expression trees (ETs), the latter being the expression of the genetic information encoded in the former. The decoding of GEP genes implies obviously a kind of code and a set of rules. The genetic code is very simple: a one-to-one relationship between the symbols of the chromosome and the functions or terminals they represent. The rules are also very simple: they determine the spatial organization of the functions and terminals in the ETs and the type of interaction between sub-ETs in multigenic systems. In GEP there are therefore two languages: the language of the genes and the language of ETs. However, thanks to the simple rules that determine the structure of ETs and their interactions, it is possible to infer immediately the phenotype given the sequence of the genotype, and vice versa. This bilingual and unequivocal system is called Karva language. The details of this new language are given in Ferreira (2001). Home | Contents | Previous | Next