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 Concept Videos

Population Growth00:57

Population Growth

Population size is dynamic, increasing with birth rates and immigration, and decreasing with death rates and emigration. In ideal conditions with unlimited resources, populations can increase exponentially, which plots as a J-shaped growth rate curve of population size against time. This type of curve is characteristic of newly-introduced invasive species, or populations that have suffered catastrophic declines and are rebounding.
Modeling with Differential Equations01:25

Modeling with Differential Equations

Population dynamics can be described mathematically by considering the population size P(t) as a function of time. The rate of change of the population is then represented by the derivative of P(t). A simple assumption is that the rate of growth is proportional to the size of the population itself. This leads to an exponential growth model, where the population increases rapidly without bound. While this is a useful first approximation, it does not reflect realistic long-term...
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
Mutation, Gene Flow, and Genetic Drift01:09

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).
Genetic Drift03:33

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.

You might also read

Related Articles

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

Sort by
Same author

BudFinder: A Masked Auto-Encoder vision transformer framework for yeast budding detection and lifespan quantification.

PLoS computational biology·2026
Same author

Bacteria as living biosensors for DNA.

Nature reviews bioengineering·2026
Same author

Rational engineering of combinatorial bacterial therapies for cancer.

Genome biology·2026
Same author

BudFinder: A Masked Auto-Encoder Vision Transformer Framework for Yeast Budding Detection.

bioRxiv : the preprint server for biology·2025
Same author

Calculating fast differential genome coverages among metagenomic sources using micov.

Communications biology·2025
Same author

Metatranscriptomics Uncover Diurnal Functional Shifts in Bacterial Transgenes with Profound Metabolic Effects.

Cell host & microbe·2025
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026
Same journal

Informative Relational Learning for Adverse Reaction Prediction with Enhanced Generalization to Novel Drugs.

Bioinformatics (Oxford, England)·2026
Same journal

An interpretable deep learning framework uncovers features governing CRISPR-Cas9 genome-editing efficiency.

Bioinformatics (Oxford, England)·2026
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
See all related articles

Related Experiment Video

Updated: May 23, 2026

Following the Dynamics of Structural Variants in Experimentally Evolved Populations
04:52

Following the Dynamics of Structural Variants in Experimentally Evolved Populations

Published on: February 3, 2023

Fast stochastic algorithm for simulating evolutionary population dynamics.

William H Mather1, Jeff Hasty, Lev S Tsimring

  • 1Department of Bioengineering, University of California-San Diego, CA 92093, USA.

Bioinformatics (Oxford, England)
|March 23, 2012
PubMed
Summary
This summary is machine-generated.

This study presents a novel algorithm for fast, accurate simulations of evolutionary dynamics, significantly speeding up computations for large populations. The method efficiently handles birth, death, and mutation events, crucial for understanding evolutionary processes.

More Related Videos

Daily Transfers, Archiving Populations, and Measuring Fitness in the Long-Term Evolution Experiment with Escherichia coli
15:00

Daily Transfers, Archiving Populations, and Measuring Fitness in the Long-Term Evolution Experiment with Escherichia coli

Published on: August 18, 2023

Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling
20:36

Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling

Published on: July 4, 2007

Related Experiment Videos

Last Updated: May 23, 2026

Following the Dynamics of Structural Variants in Experimentally Evolved Populations
04:52

Following the Dynamics of Structural Variants in Experimentally Evolved Populations

Published on: February 3, 2023

Daily Transfers, Archiving Populations, and Measuring Fitness in the Long-Term Evolution Experiment with Escherichia coli
15:00

Daily Transfers, Archiving Populations, and Measuring Fitness in the Long-Term Evolution Experiment with Escherichia coli

Published on: August 18, 2023

Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling
20:36

Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling

Published on: July 4, 2007

Area of Science:

  • Evolutionary biology
  • Computational biology
  • Population genetics

Background:

  • Simulating evolutionary dynamics in large populations over long timescales is computationally intensive.
  • Small numbers of mutants can drive evolutionary processes, introducing significant stochasticity.
  • Evolutionary events like mutation, reproduction, and death occur at vastly different time scales.

Purpose of the Study:

  • To develop a new exact algorithm for fast, fully stochastic simulations of evolutionary dynamics.
  • To address the computational expense of simulating large populations with rare mutations.
  • To provide a more efficient method for studying evolutionary processes.

Main Methods:

  • Introduction of a novel exact algorithm for stochastic simulations.
  • Algorithm incorporates birth, death, and mutation events.
  • Adaptation of the algorithm for approximate simulations of complex evolutionary models.

Main Results:

  • The algorithm achieves significant speedup compared to direct stochastic simulations.
  • Demonstrated performance on simulations of evolution on fitness landscapes.
  • Successful adaptation for simulating stochastic competitive growth models.

Conclusions:

  • The new algorithm offers a computationally efficient approach to evolutionary simulations.
  • It accurately captures stochasticity arising from rare mutations in large populations.
  • The method is versatile and applicable to various complex evolutionary scenarios.