Empirical and statistical analysis of genetic programming with linear genome

The efficiency of a genetic programming (GP) system largely depends on the representation of GP individuals. In the substitution for conventional S-expression or pointer-based systems, linear GP, in which a program structure is represented as a linear genome, was proposed. This paper´s primary research topic is the implementation of a fast, low memory consuming and ADF capable linear GP system. In order to show the effectiveness, we statistically analyze the performance of the system with some benchmark experiments