e/Defining length

Information
has gloss	eng: In genetic algorithms and genetic programming defining length L(H) is the maximum distance between two defining (i.e. non-#) symbols in schema H. In tree GP schemata, L(H) is the number of links in the minimum tree fragment including all the non-= symbols within a schema H.
lexicalization	eng: Defining Length
instance of	e/Genetic algorithm