<s>
In	O
genetic	B-Algorithm
algorithms	I-Algorithm
and	O
genetic	B-Algorithm
programming	I-Algorithm
defining	B-General_Concept
length	I-General_Concept
L(H )	O
is	O
the	O
maximum	O
distance	O
between	O
two	O
defining	O
symbols	O
(	O
that	O
is	O
symbols	O
that	O
have	O
a	O
fixed	O
value	O
as	O
opposed	O
to	O
symbols	O
that	O
can	O
take	O
any	O
value	O
,	O
commonly	O
denoted	O
as	O
#	O
or	O
*	O
)	O
in	O
schema	B-Algorithm
H	O
.	O
In	O
tree	O
GP	O
schemata	O
,	O
L(H )	O
is	O
the	O
number	O
of	O
links	O
in	O
the	O
minimum	O
tree	O
fragment	O
including	O
all	O
the	O
non-	O
=	O
symbols	O
within	O
a	O
schema	B-Algorithm
H	O
.	O
</s>
<s>
Schemata	O
"	O
00#	O
#0	O
"	O
,	O
"	O
1##	O
#1	O
"	O
,	O
"	O
01###	O
"	O
,	O
and	O
"	O
#	O
#0	O
##	O
"	O
have	O
defining	B-General_Concept
lengths	I-General_Concept
of	O
4	O
,	O
4	O
,	O
1	O
,	O
and	O
0	O
,	O
respectively	O
.	O
</s>
<s>
In	O
genetic	B-Algorithm
algorithms	I-Algorithm
as	O
the	O
defining	B-General_Concept
length	I-General_Concept
of	O
a	O
solution	O
increases	O
so	O
does	O
the	O
susceptibility	O
of	O
the	O
solution	O
to	O
disruption	O
due	O
to	O
mutation	O
or	O
cross-over	O
.	O
</s>
