Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Reconstructability analysis detection of optimal gene order in genetic algorithms

Reconstructability analysis detection of optimal gene order in genetic algorithms The building block hypothesis implies that genetic algorithm efficiency will be improved if sets of genes that improve fitness through epistatic interaction are near to one another on the chromosome. We demonstrate this effect with a simple problem, and show that information‐theoretic reconstructability analysis can be used to decide on optimal gene ordering. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Kybernetes Emerald Publishing

Reconstructability analysis detection of optimal gene order in genetic algorithms

Martin Zwick; Stephen Shervais
Kybernetes , Volume 33 (5/6): 10 – Jun 1, 2004
Download PDF
10 pages

Loading next page...
 
/lp/emerald-publishing/reconstructability-analysis-detection-of-optimal-gene-order-in-genetic-CUiUnRCedG
Publisher
Emerald Publishing
Copyright
Copyright © 2004 Emerald Group Publishing Limited. All rights reserved.
ISSN
0368-492X
DOI
10.1108/03684920410534100
Publisher site
See Article on Publisher Site

Abstract

The building block hypothesis implies that genetic algorithm efficiency will be improved if sets of genes that improve fitness through epistatic interaction are near to one another on the chromosome. We demonstrate this effect with a simple problem, and show that information‐theoretic reconstructability analysis can be used to decide on optimal gene ordering.

Journal

Kybernetes – Emerald Publishing

Published: Jun 1, 2004

Keywords: Cybernetics; Programming and algorithm theory; Optimization techniques

References

  • Constraint analysis of many‐dimensional relations
    Ashby, W.R.
  • Reducing epistasis in combinatorial problems by expansive coding
    Beasley, D.; Bull, D.; Martin, R.
  • Discrete Multivariate Analysis
    Bishop, Y.; Feinberg, S.; Holland, P.
  • Rapid, accurate optimization of difficult problems using fast messy genetic algorithms
    Goldberg, D.; Deb, K.; Kargupta, H.; Harik, G.
  • Adaptation in Natural and Artificial Systems
    Holland, J.
  • Segment congruence analysis via information theory
    Hosseini, J.C.; Harmon, R.R.; Zwick, M.
  • The Architecture of Systems Problem Solving
    Klir, G.
  • Reconstructability analysis: an offspring of Ashby's constraint theory
    Klir, G.
  • Log‐Linear Models
    Knoke, D.; Burke, P.J.
  • Information theory: structural models for qualitative data
    Krippendorff, K.
  • The Discovery and Characterization of Transposable Elements: The Collected Papers of Barbara McClintock
    McClintock, B.
  • An Introduction to Genetic Algorithms
    Mitchell, M.
  • Developing improved inventory and transportation policies for distribution systems using genetic algorithm and neural network methods
    Shervais, S.
  • Adaptive critic design of control policies for a multi‐echelon inventory system
    Shervais, S.
  • Transposition:{a} biologically inspired mechanism to use with genetic algorithms
    Simoes, A.; Costa, E.
  • The building block fallacy
    Thornton, C.
  • Wholes and parts in general systems methodology
    Zwick, M.
  • Discrete Multivariate Modeling
    Zwick, M.