Mutation and crossover are the main search operators of different variants of evolutionary algorithms. Despite the many discussions on the importance of crossover nobody has proved rigorously for some explicitly defined fitness functions fn : {0, 1} n → R that a genetic algorithm with crossover (but without idealization) can optimize fn in expected polynomial time while all evolution strategies...

We study the crossover scaling behavior of the height-height correlation function in interface depinning in random media. We analyze experimental data from a fracture experiment and simulate an elastic line model with nonlinear couplings and disorder. Both exhibit a crossover between two different universality classes. For the experiment, we fit a functional form to the universal crossover scal...

Sex differences in recombination are widespread in mammals, but the causes of this pattern are poorly understood. Previously, males from two interfertile subspecies of house mice, Mus musculus musculus and M. m. castaneus, were shown to exhibit a ∼30% difference in their global crossover frequencies. Much of this crossover rate divergence is explained by six autosomal loci and a large-effect lo...

In this work we present a new approach to crossover operator in the genetic evolution of neural networks. The most widely used evolutionary computation paradigm for neural network evolution is evolutionary programming. This paradigm is usually preferred due to the problems caused by the application of crossover to neural network evolution. However, crossover is the most innovative operator with...

Crossover refers to a pattern of performance on the line bisection test in which short lines are bisected on the side opposite the true center of long lines. Although most patients with spatial neglect demonstrate crossover, contemporary theories of neglect cannot explain it. In contrast, we show that blending the psychophysical construct of magnitude estimation with neglect theory not only exp...

Crossovers generated by homologous recombination ensure proper chromosome segregation during meiosis. Crossover interference results in chiasmata being more evenly distributed along chromosomes, but the mechanism underlying crossover interference remains elusive. Based on large pedigrees of Holstein and Jersey cattle with genotype data, we extracted three-generation families, including 147,327 ...

Meiotic crossover frequencies show wide variation among organisms. But most organisms maintain at least one crossover per homolog pair (obligate crossover). In Saccharomyces cerevisiae, previous studies have shown crossover frequencies are reduced in the mismatch repair related mutant mlh3Δ and enhanced in a meiotic checkpoint mutant pch2Δ by up to twofold at specific chromosomal loci, but both...

In the last two years the schema theory for Genetic Programming (GP) has been applied to the problem of understanding the length biases of a variety of crossover and mutation operators on variable length linear structures. In these initial papers, operators were studied in isolation. In practice, however, they are typically used in various combinations, and in this paper we present the first sc...

Intrinsic parallelism is shown to have application beyond schemata and o-schemata. More general objects called formae are introduced and general operators which manipulate these are introduced and discussed. These include random, respectful recombination. The extended formalism is applied to various common representations and standard operators are analysed in the light of the formalism.

In this paper a new general schema theory for genetic programming is presented. Like other recent GP schema theory results (Poli 2000a, Poli 2000b), the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Cartesian node reference system which makes it possible to describe programs as func...