Related Experiment Video
Updated: Jun 11, 2026

Generating Transgenic Plants with Single-copy Insertions Using BIBAC-GW Binary Vector
Published on: March 28, 2018
Representation invariant genetic operators
Jonathan E Rowe1, Michael D Vose, Alden H Wright
1School of Computer Science, University of Birmingham, Birmingham, B15 2TT, UK. J.E.Rowe@cs.bham.ac.uk
Abstract:
A genetic algorithm is invariant with respect to a set of representations if it runs the same no matter which of the representations is used. We formalize this concept mathematically, showing that the representations generate a group that acts upon the search space. Invariant genetic operators are those that commute with this group action. We then consider the problem of characterizing crossover and mutation operators that have such invariance properties. In the case where the corresponding group action acts transitively on the search space, we provide a complete characterization, including high-level representation-independent algorithms implementing these operators.
Related Concept Videos
Law of Independent Assortment
Law of Independent Assortment
Genetic Variation
Genes exist in different versions called alleles, which...
Hardy-Weinberg Principle
Genetic Material
Non-nuclear Inheritance
