Jump to content

Linear tree

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SmackBot (talk | contribs) at 11:38, 1 January 2007 (Date/fix the maintenance tags using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In genetic programming (GP) a linear tree is a program composed of a variable number of unary functions and a single terminal. Note linear tree GP differs from bit string genetic algorithms since a population may contain programs of different lengths and there may be more than two types of functions or more than two types of terminals.

References

Foundations of Genetic Programming.