next up previous contents
Next: 3 Experimental Details Up: 3 Genetic Outliers and Previous: 1 The Tree-String Problem   Contents

2 Relevance to Other Domains

The Tree-String problem is similar to the Royal Tree problem [Punch et al., 1996] where an objective is a predefined structure. However, the Royal Tree problem gives maximum credit to full trees with specific functions and terminals at specific depths in a hierarchical fitness function. An extension of the Royal Tree [Platel et al., 2003] is also related where an objective is matching contiguous symbols in a string in the context of a linear representation. The structural aspect of the Tree-String problem is also similar to the Lid problem [Daida et al., 2003b] where a structure at a pre-defined depth and size is the objective. However, the Lid problem is concerned with structure and does not consider the effects of content or context that are present in other problem domains.

With respect to other problem domains, the following characteristics are relevant:

Given these properties of the Tree-String problem and the similarities to other common domains, the problem appears to be representative of the general class of problems to which genetic programming is typically applied. Of course, additional analysis is required to verify these speculated properties and behaviours of the Tree-String problem.


next up previous contents
Next: 3 Experimental Details Up: 3 Genetic Outliers and Previous: 1 The Tree-String Problem   Contents
S Gustafson 2004-05-20