Aytekin, TevfikKorkmaz, E. ErkanGüvenir, H. Altay2019-04-222019-04-22199597835406015480302-9743http://hdl.handle.net/11693/50872Conference name: AI '93 and AI '94 Workshops on Evolutionary Computation Melbourne, Victoria, Australia, November 16, 1993 Armidale, NSW, Australia, November 21–22, 1994Date of Conference: November 16, 1993Date of Conference: November 21–22, 1994In 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.EnglishGenetic programmingCrossover pointMutation operationCrossover operationConference Paper10.1007/3-540-60154-6_4510.1007/3-540-60154-61611-3349