Genetic Algorithm Schema

In a binary genetic algorithm, a schema is a template over the alphabet , where matches either binary digit. A string matches the schema if it agrees with every fixed digit. The order of a schema is the number of fixed positions, and its defining length is the distance between its first and last fixed positions. A schema of order matches strings of length . The propagation of schemata under selection, crossover, and mutation is bounded by Holland's schema theorem.