Skip to main content
Article thumbnail
Location of Repository

Epistasis On Finite And Infinite Spaces

By B. Naudts and A. Verschoren


The main purpose of this text is to present a brief overview of recent results on epistasis. The first part of the note introduces epistasis and deals with epistasis on finite search spaces. It covers both minimally epistatic, i.e., linear, and maximally epistatic functions. The second part introduces epistasis and excess values on infinite search spaces. Some properties of this generalization are discussed, among them the fact that epistasis, under certain circumstances, reduces to the L 2 norm. We do not aim to go into the mathematical details here, instead referring to recently published literature. Keywords Genetic algorithm, epistasis, infinite search spaces, encoding Introduction One cannot stress too much the role played by the encoding when studying and applying GA's. One of the problems a GA may encounter, and which makes it GA-hard, is that there is too much redundancy in the encoding, and that, in particular, some of the loci (i.e., positions in a string) are correlated...

Topics: epistasis, infinite search spaces, encoding
Year: 2007
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.