Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Efficient linkage discovery by limited probing.

Robert B Heckendorm1, Alden H Wright

  • 1Department of Computer Science, University of Idaho, Moscow, ID 83844-1010, USA. heckendo@uidaho.edu

Evolutionary Computation
|March 17, 2005
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Representation invariant genetic operators.

Evolutionary computation·2010
Same author

Reinterpreting no free lunch.

Evolutionary computation·2009
Same author

State aggregation and population dynamics in linear systems.

Artificial life·2005
Same author

Structural search spaces and genetic operators.

Evolutionary computation·2005
Same author

Group properties of crossover and mutation.

Evolutionary computation·2002
Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026
Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026
Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026
Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026
Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026
Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026
See all related articles

This study introduces a randomized algorithm to uncover the complete epistatic structure of black-box fitness functions. The method identifies how gene interactions influence outcomes, crucial for understanding complex biological systems.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genetics

Background:

  • Understanding fitness functions is key in evolutionary computation and bioinformatics.
  • Epistasis describes gene interactions where one gene masks or modifies the effect of another.
  • Discovering epistatic structure from black-box functions is computationally challenging.

Purpose of the Study:

  • To develop a method for discovering the epistatic structure of fitness functions.
  • To analyze a randomized algorithm for identifying gene interactions.
  • To determine the Walsh coefficients representing the function's structure.

Main Methods:

  • A randomized algorithm is presented and analyzed.
  • The algorithm operates on binary strings mapping to real values.

Related Experiment Videos

  • Assumptions include bounded epistasis and a black-box function oracle.

    • Main Results:

    • The algorithm successfully identifies the complete epistatic structure.
    • The structure is represented by the function's Walsh coefficients.
    • Analysis confirms the algorithm's effectiveness under bounded epistasis.

    Conclusions:

    • A novel randomized algorithm can efficiently determine the epistatic structure of fitness functions.
    • This approach provides a powerful tool for analyzing gene interactions in silico.
    • The findings have implications for fields relying on understanding complex biological systems.