This technique is targeted at fixed-length binary representations but allows the representation to be under or over specified. Each gene in the chromosome contains a value (a bit) and its position. The chromosomes are of variable length and may contain too few or too many bits for the representation. The technique is also targeted at deceptive binary bitstring problems. The algorithm adapts its representation to a particular instance of the problem being solved.
(from RefLeung2002)
This cites Goldberg et al. 1988? with regards to Messy GAs?.
< Delta Coding | ThingsLookedUp | Gray Code >