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

Genetic Drift03:33

Genetic Drift

42.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.
42.4K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

195
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
195
Mutation, Gene Flow, and Genetic Drift01:09

Mutation, Gene Flow, and Genetic Drift

61.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).
61.1K
Mismatch Repair01:20

Mismatch Repair

6.0K
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...
6.0K
Gene Conversion02:08

Gene Conversion

10.3K
Other than maintaining genome stability via DNA repair, homologous recombination plays an important role in diversifying the genome. In fact, the recombination of sequences forms the molecular basis of genomic evolution. Random and non-random permutations of genomic sequences create a library of new amalgamated sequences. These newly formed genomes can determine the fitness and survival of cells. In bacteria, homologous and non-homologous types of recombination lead to the evolution of new...
10.3K
Viral Recombination00:57

Viral Recombination

24.5K
Cells are sometimes infected by more than one virus at once. When two viruses disassemble to expose their genomes for replication in the same cell, similar regions of their genomes can pair together and exchange sequences in a process called recombination. Alternatively, viruses with segmented genomes can swap segments in a process called reassortment.
24.5K

You might also read

Related Articles

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

Sort by
Same author

Comparative study of three PCR-based copy number variant approaches, CFMSA, M-PCR, and MLPA, in 22q11.2 deletion syndrome.

Genetic testing and molecular biomarkers·2009
Same author

[Influence on electroacupuncture at "Qiangzhuang" acupoints for neuro-immune regulation of sub-acute aged rats].

Zhongguo zhen jiu = Chinese acupuncture & moxibustion·2009
Same author

[Effects of killer immunoglobulin-like receptor and human leukocyte antigen class I ligand on the prognosis of related donor hematopoietic stem cell transplantation].

Zhongguo yi xue ke xue yuan xue bao. Acta Academiae Medicinae Sinicae·2009
Same author

[Treatment of nonunion of tibia with superficial peroneal vascular fascia pedicel tibiofibular periosteal flap].

Zhongguo xiu fu chong jian wai ke za zhi = Zhongguo xiufu chongjian waike zazhi = Chinese journal of reparative and reconstructive surgery·2009
Same author

[Expression, purification and activity analysis of BCG HSP70.].

Xi bao yu fen zi mian yi xue za zhi = Chinese journal of cellular and molecular immunology·2009
Same author

Comparison of diffusion-weighted with T2-weighted Imaging for detection of small hepatocellular carcinoma in cirrhosis: preliminary quantitative study at 3-T.

Academic radiology·2009
Same journal

An Evolutionary Algorithm Assisted by an Ensemble of Pareto-Optimal Surrogate Models.

IEEE transactions on cybernetics·2026
Same journal

A Quantum Self-Attention Neural Network Model on Quantum Circuits.

IEEE transactions on cybernetics·2026
Same journal

Semi-Explicit Solution of Some Discrete-Time Higher-Order-Cost Mean-Field-Type Control.

IEEE transactions on cybernetics·2026
Same journal

A Novel One-Step Small Object Detector for Autonomous Aerial Vehicles.

IEEE transactions on cybernetics·2026
Same journal

Online Data-Driven-Based Optimal Output Tracking Control Without Initial Stabilizing Policy.

IEEE transactions on cybernetics·2026
Same journal

Digital Redesign-Based Interval State Estimation for Continuous Systems With Aperiodic Discrete Measurements.

IEEE transactions on cybernetics·2026
See all related articles

Related Experiment Video

Updated: Dec 2, 2025

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

11.3K

Distributed Memetic Algorithm for Outsourced Database Fragmentation.

Yong-Feng Ge, Wei-Jie Yu, Jinli Cao

    IEEE Transactions on Cybernetics
    |November 4, 2020
    PubMed
    Summary
    This summary is machine-generated.

    A novel distributed memetic algorithm (DMA) enhances database privacy and utility in outsourced data storage. This approach balances data protection with efficient query performance, outperforming traditional methods.

    More Related Videos

    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
    The Green Monster Process for the Generation of Yeast Strains Carrying Multiple Gene Deletions
    13:06

    The Green Monster Process for the Generation of Yeast Strains Carrying Multiple Gene Deletions

    Published on: December 15, 2012

    14.6K

    Related Experiment Videos

    Last Updated: Dec 2, 2025

    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

    11.3K
    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
    The Green Monster Process for the Generation of Yeast Strains Carrying Multiple Gene Deletions
    13:06

    The Green Monster Process for the Generation of Yeast Strains Carrying Multiple Gene Deletions

    Published on: December 15, 2012

    14.6K

    Area of Science:

    • Computer Science
    • Data Security
    • Database Management

    Background:

    • Outsourced data storage necessitates balancing data privacy and utility.
    • Traditional encryption methods hinder data query efficiency.
    • Database fragmentation offers a privacy-preserving alternative.

    Purpose of the Study:

    • To propose a distributed memetic algorithm (DMA) for enhanced database privacy and utility.
    • To design a framework for high optimization efficiency in distributed environments.
    • To introduce novel operators for improved evolutionary search and data arrangement.

    Main Methods:

    • A balanced best random distributed framework for optimization efficiency.
    • Dynamic grouping recombination, merge/split mutation operators for evolutionary elements.
    • Two-dimension selection prioritizing privacy and utility, with splicing-driven local search.

    Main Results:

    • Extensive experiments validate the performance of the proposed DMA.
    • The effectiveness of the distributed framework and novel operators is confirmed.
    • The DMA successfully enhances both database privacy and utility.

    Conclusions:

    • The proposed DMA offers an effective solution for privacy-utility trade-offs in outsourced databases.
    • The novel operators and distributed framework contribute to efficient and robust data management.
    • This research advances techniques for secure and efficient data storage solutions.