Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Hardy-Weinberg Principle

Hardy-Weinberg Principle

Diploid organisms have two alleles of each gene, one from each parent, in their somatic cells. Therefore, each individual contributes two alleles to the gene pool of the population. The gene pool of a population is the sum of every allele of all genes within that population and has some degree of variation. Genetic variation is typically expressed as a relative frequency, which is the percentage of the total population that has a given allele, genotype or phenotype.

Genetic Drift

Genetic Drift

Natural selection—probably the most well-known evolutionary mechanism—increases the prevalence of traits that enhance survival and reproduction. However, evolution does not merely propagate favorable traits, nor does it always benefit populations.

Mutation, Gene Flow, and Genetic Drift

Mutation, Gene Flow, and Genetic Drift

In a population that is not at Hardy-Weinberg equilibrium, the frequency of alleles changes over time. Therefore, any deviations from the five conditions of Hardy-Weinberg equilibrium can alter the genetic variation of a given population. Conditions that change the genetic variability of a population include mutations, natural selection, non-random mating, gene flow, and genetic drift (small population size).

Genetics of Speciation

Genetics of Speciation

Speciation is the evolutionary process resulting in the formation of new, distinct species—groups of reproductively isolated populations.

Probability Laws

Probability Laws

What is Population Genetics?

What is Population Genetics?

A population is composed of members of the same species that simultaneously live and interact in the same area. When individuals in a population breed, they pass down their genes to their offspring. Many of these genes are polymorphic, meaning that they occur in multiple variants. Such variations of a gene are referred to as alleles. The collective set of all the alleles within a population is known as the gene pool.

You might also read

Related Articles

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

Sort by

Same author

p38 mitogen-activated protein kinase gene silencing rescues rat hippocampal neurons from ketamine-induced apoptosis: An in vitro study.

International journal of molecular medicine·2018

Same author

The analysis of Range Quickselect and related problems.

Theoretical computer science·2011

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

Search research articles

Related Experiment Video

Updated: Feb 28, 2026

Following the Dynamics of Structural Variants in Experimentally Evolved Populations

Following the Dynamics of Structural Variants in Experimentally Evolved Populations

Published on: February 3, 2023

Probabilistic Analysis of the (1+1)-Evolutionary Algorithm.

Hsien-Kuei Hwang¹, Alois Panholzer², Nicolas Rolin³

¹Institute of Statistical Science & Institute of Information Science, Academia Sinica, Taipei 115, Taiwan hkhwang@stat.sinica.edu.tw.

Evolutionary Computation

|June 21, 2017

Summary

This summary is machine-generated.

This study analyzes the optimization time of the [Formula: see text]-Evolutionary Algorithm for OneMax and LeadingOnes problems. We provide the most rigorous asymptotic approximations for mean and variance to date.

Keywords:

(1+1)-evolutionary algorithm LeadingOnes function OneMax function asymptotic approximations error analysis limit laws probabilistic analysis recurrences.

More Related Videos

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Published on: August 14, 2018

Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling

Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling

Published on: July 4, 2007

Related Experiment Videos

Last Updated: Feb 28, 2026

Following the Dynamics of Structural Variants in Experimentally Evolved Populations

Following the Dynamics of Structural Variants in Experimentally Evolved Populations

Published on: February 3, 2023

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Published on: August 14, 2018

Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling

Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling

Published on: July 4, 2007

Area of Science:

Computer Science
Artificial Intelligence
Optimization Algorithms

Background:

Evolutionary algorithms are widely used for complex problem-solving.
Analyzing the performance of these algorithms, particularly their optimization time, is crucial for understanding their efficiency.
Previous analyses of [Formula: see text]-Evolutionary Algorithm (Formula-EA) performance have varied in rigor.

Purpose of the Study:

To provide a detailed analysis of the optimization time for the [Formula: see text]-Evolutionary Algorithm.
To develop rigorous asymptotic approximations for the mean and variance of the optimization time.
To extend the analysis to characterize the limiting distributions of the optimization time.

Main Methods:

Asymptotic analysis of the underlying recurrence relations governing the Formula-EA.
Heuristic calculations using matched asymptotics for initial approximations.
Delicate error analysis for rigorous justification of approximations.

Main Results:

Strongest asymptotic approximations for the mean and variance of optimization time for Formula-EA on OneMax and LeadingOnes.
The developed approach allows for the characterization of limiting distributions.
Demonstration of the challenges in rigorous error analysis for these approximations.

Conclusions:

The study offers a significant advancement in the theoretical understanding of Formula-EA performance.
The rigorous analysis provides reliable bounds and insights into the algorithm's behavior.
The methodology can be extended to analyze other evolutionary algorithms and fitness functions.