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

Mutation, Gene Flow, and Genetic Drift01:09

Mutation, Gene Flow, and Genetic Drift

53.1K
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).
53.1K
Mutations01:35

Mutations

31.2K
Mutations are changes in the sequence of DNA. These changes can occur spontaneously or they can be induced by exposure to environmental factors. Mutations can be characterized in a number of different ways: whether and how they alter the amino acid sequence of the protein, whether they occur over a small or large area of DNA, and whether they occur in somatic cells or germline cells.
Chromosomal Alterations Are Large-Scale Mutations
While point mutations are changes in a single nucleotide in...
31.2K
Mutations01:39

Mutations

66.8K
Overview
66.8K
Mutations01:39

Mutations

11.0K
11.0K
Genetic Drift03:33

Genetic Drift

35.4K
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.
35.4K
Genome Size and the Evolution of New Genes03:21

Genome Size and the Evolution of New Genes

7.5K
While every living organism has a genome of some kind (be it RNA, or DNA), there is considerable variation in the sizes of these blueprints. One major factor that impacts genome size is whether the organism is prokaryotic or eukaryotic. In prokaryotes, the genome contains little to no non-coding sequence, such that genes are tightly clustered in groups or operons sequentially along the chromosome. Conversely, the genes in eukaryotes are punctuated by long stretches of non-coding sequence.
7.5K

You might also read

Related Articles

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

Sort by
Same journal

The Outcome of Cardiac Hydatid Surgery in The Iraqi Center of Heart Diseases.

F1000Research·2026
Same journal

Perception of body donation among the Phase-1 medical students, a questionnaire-based study.

F1000Research·2026
Same journal

Exploring Infertility in Saudi Arabia: Qualitative Insights into IVF Treatment Services and Policy Recommendations.

F1000Research·2026
Same journal

Cyber Military Operations under International Humanitarian Law: Interpreting the Concept of "Attack" and Challenges in Protecting Civilians.

F1000Research·2026
Same journal

Sentiment Analysis of Acceptance TVET Online Courses on the Skill Academy App from Google Play: Leveraging Text Mining with Comparison Machine Learning Model.

F1000Research·2026
Same journal

Emotional intelligence: An important skill to learn now more than ever.

F1000Research·2026
See all related articles

Related Experiment Video

Updated: May 2, 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

1.2K

A novel pseudoderivative-based mutation operator for real-coded adaptive genetic algorithms.

Maxinder S Kanwal1, Avinash S Ramesh1, Lauren A Huang1

  • 1Thomas Jefferson High School for Science and Technology, Alexandria, VA 22312, USA.

F1000Research
|March 18, 2014
PubMed
Summary
This summary is machine-generated.

This study introduces an adaptive mutation rate for genetic algorithms, enhancing their ability to find global optima in complex optimization problems. This novel approach improves search strategies in computational biology and neurology.

More Related Videos

Design and Use of a Low Cost, Automated Morbidostat for Adaptive Evolution of Bacteria Under Antibiotic Drug Selection
10:50

Design and Use of a Low Cost, Automated Morbidostat for Adaptive Evolution of Bacteria Under Antibiotic Drug Selection

Published on: September 27, 2016

9.5K
Directed Evolution Method in Saccharomyces cerevisiae: Mutant Library Creation and Screening
10:50

Directed Evolution Method in Saccharomyces cerevisiae: Mutant Library Creation and Screening

Published on: April 1, 2016

10.4K

Related Experiment Videos

Last Updated: May 2, 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

1.2K
Design and Use of a Low Cost, Automated Morbidostat for Adaptive Evolution of Bacteria Under Antibiotic Drug Selection
10:50

Design and Use of a Low Cost, Automated Morbidostat for Adaptive Evolution of Bacteria Under Antibiotic Drug Selection

Published on: September 27, 2016

9.5K
Directed Evolution Method in Saccharomyces cerevisiae: Mutant Library Creation and Screening
10:50

Directed Evolution Method in Saccharomyces cerevisiae: Mutant Library Creation and Screening

Published on: April 1, 2016

10.4K

Area of Science:

  • Computational biology
  • Bioinformatics
  • Artificial intelligence

Background:

  • Large-scale genetics and proteomics databases necessitate advanced computational algorithms.
  • Artificial intelligence, including neural networks and genetic algorithms, offers effective search strategies.

Purpose of the Study:

  • To optimize genetic algorithms by developing an adaptive mutation rate.
  • To enable genetic algorithms to escape local optima and find global optima.

Main Methods:

  • Proposed a novel pseudoderivative-based mutation rate operator.
  • Compared successive generation fitness values to derive the adaptive mutation rate.
  • Tested the algorithm on 3D surfaces and the N-queens problem.

Main Results:

  • The adaptive mutation rate successfully guided the genetic algorithm to the global optimal solution in all tests.
  • The proposed method significantly outperformed genetic algorithms with fixed mutation rates.
  • Demonstrated effectiveness on problems with multiple local optima and implicit functions.

Conclusions:

  • The adaptive mutation rate is a significant improvement for genetic algorithms in complex optimization.
  • This approach holds promise for applications in neurology and bioinformatics.
  • The algorithm effectively avoids local optima, ensuring convergence to the global optimum.