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

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).Mechanisms of Genetic VariationThe original sources of genetic variation are mutations,...
Point and Frameshift Mutations01:30

Point and Frameshift Mutations

Point mutations are genetic alterations involving the change of a single nucleotide base pair in DNA. Depending on how the alteration affects protein synthesis, they can lead to various consequences.Point mutations fall into the following types:Silent mutations occur when a nucleotide change does not alter the amino acid sequence due to the redundancy of the genetic code. For instance, changing ACC to ACA still encodes threonine, leaving the protein function unaffected. This occurs because...
Multi-species Conserved Sequences02:51

Multi-species Conserved Sequences

Next-generation sequencing technologies have created large genomic databases of a variety of animals and plants. Ever since the human genome project was completed, scientists studied the genome of primates, mammals, and other phylogenetically distant living beings. Such large-scale  studies have provided new insights into the evolutionary relationship between organisms.
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved DNA...
Mismatch Repair01:20

Mismatch Repair

Organisms are capable of detecting and fixing nucleotide mismatches that occur during DNA replication. This sophisticated process requires identifying the new strand and replacing the erroneous bases with correct nucleotides. Mismatch repair is coordinated by many proteins in both prokaryotes and eukaryotes.
The Mutator Protein Family Plays a Key Role in DNA Mismatch Repair
The human genome has more than 3 billion base pairs of DNA per cell. Prior to cell division, that vast amount of genetic...
Mutations01:39

Mutations

Overview
Mutations01:35

Mutations

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...

You might also read

Related Articles

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

Sort by
Same author

Predicting noncoding RNA and disease associations using multigraph contrastive learning.

Scientific reports·2025
Same author

DGSIST: Clustering spatial transcriptome data based on deep graph structure Infomax.

Methods (San Diego, Calif.)·2024
Same author

Improved Intrusion Detection Based on Hybrid Deep Learning Models and Federated Learning.

Sensors (Basel, Switzerland)·2024
Same author

Ethereum Phishing Scam Detection Based on Data Augmentation Method and Hybrid Graph Neural Network Model.

Sensors (Basel, Switzerland)·2024
Same author

Prediction of miRNAs and diseases association based on sparse autoencoder and MLP.

Frontiers in genetics·2024
Same author

Advancing single-cell RNA-seq data analysis through the fusion of multi-layer perceptron and graph neural network.

Briefings in bioinformatics·2024
Same journal

A fungus, anastomosis, diploids and quantum mechanics.

Rivista di biologia·2011
Same journal

Understanding hematopoietic stem cell mobility pattern through mathematics.

Rivista di biologia·2011
Same journal

Quiescene and stress:a bioelectrical viewpoint.

Rivista di biologia·2011
Same journal

The fractal revolution: to see a world in a grain of sand.

Rivista di biologia·2011
Same journal

Environmental risk assessment in GMO analysis.

Rivista di biologia·2011
Same journal

Prions: a mystery unravelled?

Rivista di biologia·2011
See all related articles

Related Experiment Video

Updated: Jun 20, 2026

Isolation of Fidelity Variants of RNA Viruses and Characterization of Virus Mutation Frequency
18:10

Isolation of Fidelity Variants of RNA Viruses and Characterization of Virus Mutation Frequency

Published on: June 16, 2011

Binary particle swarm optimization algorithm with mutation for multiple sequence alignment.

Hai-Xia Long1, Wen-Bo Xu, Jun Sun

  • 1School of Information Technology, Jiangnam University, No. 1800, Lihudadao Road, Wuxi, Jiangsu 214122, China. haixia_long@163.com

Rivista Di Biologia
|September 1, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces a novel mutation-based binary particle swarm optimization (M-BPSO) algorithm to solve the complex multiple sequence alignment (MSA) problem. The M-BPSO algorithm demonstrates superior performance and efficiency for biological sequence analysis.

More Related Videos

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Related Experiment Videos

Last Updated: Jun 20, 2026

Isolation of Fidelity Variants of RNA Viruses and Characterization of Virus Mutation Frequency
18:10

Isolation of Fidelity Variants of RNA Viruses and Characterization of Virus Mutation Frequency

Published on: June 16, 2011

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Evolutionary Computation

Background:

  • Multiple sequence alignment (MSA) is crucial for analyzing biological sequences.
  • The computational complexity of MSA increases exponentially with sequence scale, posing significant challenges.

Purpose of the Study:

  • To develop an efficient algorithm for solving the multiple sequence alignment problem.
  • To improve upon existing methods for MSA by addressing local optima and convergence speed.

Main Methods:

  • Proposed a mutation-based binary particle swarm optimization (M-BPSO) algorithm.
  • Integrated a mutation operator into the BPSO algorithm to enhance exploration and convergence.
  • Tested the algorithm on nucleic acid and amino acid sequences.

Main Results:

  • The M-BPSO algorithm demonstrated superior performance compared to existing algorithms.
  • The algorithm achieved faster convergence and effectively escaped local optima.
  • Efficient performance was observed for smaller and medium-sized biological sequences.

Conclusions:

  • M-BPSO offers an effective and efficient solution for multiple sequence alignment.
  • The algorithm shows promise for practical applications in biological sequence analysis.