This paper presents the limitations of existing theories meant to explain parasitic gaps in relation with weak crossover effect and Across the Board gaps.

It proves a schema theorem for genetic algorithms in which representation schema is based on graph grammar. The effect of crossover and mutation on schemata is described.

The most important requirment for analysis and interpretation of the crossover design is that there is no carry-over effect from the first treatment to the second.