abstract = "In Genetic programming (GP) applications the programs
are expressed as parse trees. A node of a parse tree is
an element either from the function-set or
terminal-set, and an element of a terminal set can be
used in a parse tree more than once. However, when we
attempt to use the elements in the terminal set at most
once, we encounter problems in creating the initial
random population and in crossover and mutation
operations. 4-Op problem is an example for such a
situation. We developed a technique called map-trees to
overcome these anomalies. Experimental results on 4-Op
using map-trees are presented.",
notes = "
Also technical report BU-CEIS-9441 Bilkent University
Department of Computer Engineering",