- author = "Maarten Keijzer",
- title = "Efficiently Representing Populations in Genetic Programming",
- booktitle = "Advances in Genetic Programming 2",
- publisher = "MIT Press",
- year = "1996",
- editor = "Peter J. Angeline and K. E. {Kinnear, Jr.}",
- pages = "259--278",
- chapter = "13",
- address = "Cambridge, MA, USA",
- keywords = "genetic algorithms, genetic programming",
- ISBN = "0-262-01158-1",
-
URL = "
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6277535",
-
DOI = "
doi:10.7551/mitpress/1109.003.0019",
- size = "20 pages",
-
abstract = "The chapter compares two representations for genetic
programming. One is the commonly used Lisp S-Expression
which uses the problem specific terminals and functions
defined before a run as an alphabet. The other is a
minimal Directed Acyclic Graph (DAG) that uses a
variable alphabet of complete subtrees. This chapter
will show that the DAG representation can replace
S-Expression representation without any change in the
functionality of a genetic programming system. In
certain situations the amount of memory needed to
represent a population can be reduced enormously when
using a DAG. The implementation of Automatically
Defined Functions (ADFs) in a DAG gives rise to the
definitions of a divergent ADF, and a compact ADF. The
latter can represent huge programs in S-Expression
format with a few elements.
",
