Jump to content

Linear tree

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 155.245.23.156 (talk) at 19:55, 18 February 2005 (WBL add citation to Foundations of Genetic Programming). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In genetic programming 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 functions or more than two types of terminals.

References

[[1] Foundations of Genetic Programming].