Allele, in biology, is the term given to the appropriate range of values for genes. In genetic algorithms, an allele is the value of the gene (or genes).

Atoms are the mathematical or symbolic operators in the parse tree. Atoms are always internal (non-leaf) nodes as all atoms accept arguments.

Closure is based on the design of genetic operators to ensure the validity of functions generated by the genetic program. If closure is achieved, the functions will not cause errors, regardless of the [..]

Convergence is a reduction in the diversity of genes available in the population due to fitness proportionate operators.

Diversity is the term used to describe the relative uniqueness of each individual in the population. This condition is considered favourable as the greater the variety of genes available to the geneti [..]

The set of functions (atoms) available to the genetic program. The operators in the function set are used to make up the internal nodes of the parse tree.

A generation is an iteration of the genetic algorithm. Conventionally, the initial random generation is known as generation zero.

The genotype is the structure of the solution produced by the genetic program.

Inversion is a genetic operator sometimes used in genetic algorithms where two points in the string are chosen and the order of the genes between those two points are reversed (inverted).

A leaf node is a node in a parse tree with no children; a terminal.