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

Homologous Recombination02:31

Homologous Recombination

62.6K
The basic reaction of homologous recombination (HR) involves two chromatids that contain DNA sequences sharing a significant stretch of identity. One of these sequences uses a strand from another as a template to synthesize DNA in an enzyme-catalyzed reaction. The final product is a novel amalgamation of the two substrates. To ensure an accurate recombination of sequences, HR is restricted to the S and G2 phases of the cell cycle. At these stages, the DNA has been replicated already and the...
62.6K
Lagging Strand Synthesis01:59

Lagging Strand Synthesis

60.9K
During replication, the complementary strands in double-stranded DNA are synthesized at different rates. Replication first begins on the leading strand. Replication starts later, occurs more slowly, and proceeds discontinuously on the lagging strand.
There are several major differences between synthesis of the leading strand and synthesis of the lagging strand. 1) Leading strand synthesis happens in the direction of replication fork opening, whereas lagging strand synthesis happens in the...
60.9K
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

687
Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
687
Distributed Loads: Problem Solving01:21

Distributed Loads: Problem Solving

1.1K
Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...
1.1K
Restarting Stalled Replication Forks02:37

Restarting Stalled Replication Forks

6.3K
DNA replication is initiated at sites containing predefined DNA sequences known as origins of replication. DNA is unwound at these sites by the minichromosome maintenance (MCM) helicase and other factors such as Cdc45 and the associated GINS complex.The unwound single strands are protected by replication protein A (RPA) until DNA polymerase starts synthesizing DNA at the 5’ end of the strand in the same direction as the replication fork. To prevent the replication fork from falling apart,...
6.3K
Mismatch Repair01:36

Mismatch Repair

43.5K
Overview
43.5K

You might also read

Related Articles

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

Sort by
Same author

Dmpic as an Orthogonal Protecting Group for Aspartic Acid Side Chains: Facilitating the Synthesis of Lactam-Cyclized Peptides.

The Journal of organic chemistry·2026
Same author

Multi-modal graph neural networks with cross-view attention and contrastive learning for molecular property prediction.

Computer methods in biomechanics and biomedical engineering·2026
Same author

Heparin microarray-based specific interaction assay of marine sulfated polysaccharides with antithrombin â…¢.

Communications chemistry·2026
Same author

Fourier-Enhanced Kolmogorov-Arnold Network With Attention for Drug-Target Interaction Prediction.

IEEE transactions on computational biology and bioinformatics·2026
Same author

Enhancing the reliability of skin tone evaluation: A study of full-face imaging devices with colour calibration.

International journal of cosmetic science·2026
Same author

Deep contrastive learning method for drug-target interactions prediction.

Computer methods in biomechanics and biomedical engineering·2026
Same journal

Exploring Complex Genetic Mechanisms in Brain Imaging Genetics via a New Multi-task Learning Method.

IEEE transactions on computational biology and bioinformatics·2026
Same journal

A Multi-Modal Framework for Phage-Host Interaction Prediction Using Multi-View Contrastive Learning.

IEEE transactions on computational biology and bioinformatics·2026
Same journal

Decoding Gene-Disease Associations with Computational Methods: A Survey.

IEEE transactions on computational biology and bioinformatics·2026
Same journal

A Competitive Coevolution-based Cancer Driver Pathway Identification Algorithm for Maximizing Coverage, Mutual Exclusivity, and Subnet Importance.

IEEE transactions on computational biology and bioinformatics·2026
Same journal

Prediction of GO Terms Based on Partitioning PPI Networks into Highly Connected Components.

IEEE transactions on computational biology and bioinformatics·2026
Same journal

Modeling and Tracking of Heterogeneous Cell Populations via Open Multi-Agent Systems.

IEEE transactions on computational biology and bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Jan 14, 2026

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
09:26

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

Published on: December 29, 2021

4.8K

A DNA Strand Displacement-Based Computing Model for Solving Intractable Graph Problems.

Enqiang Zhu, Xianhang Luo, Chanjuan Liu

    IEEE Transactions on Computational Biology and Bioinformatics
    |October 22, 2025
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a novel DNA computing model for solving complex graph problems. The model utilizes a graph representation module and a detection module, demonstrating potential for tackling NP-hard challenges.

    More Related Videos

    Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks
    07:50

    Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks

    Published on: November 25, 2015

    14.9K
    A Simple, Robust, and High Throughput Single Molecule Flow Stretching Assay Implementation for Studying Transport of Molecules Along DNA
    12:05

    A Simple, Robust, and High Throughput Single Molecule Flow Stretching Assay Implementation for Studying Transport of Molecules Along DNA

    Published on: October 1, 2017

    8.6K

    Related Experiment Videos

    Last Updated: Jan 14, 2026

    DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
    09:26

    DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

    Published on: December 29, 2021

    4.8K
    Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks
    07:50

    Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks

    Published on: November 25, 2015

    14.9K
    A Simple, Robust, and High Throughput Single Molecule Flow Stretching Assay Implementation for Studying Transport of Molecules Along DNA
    12:05

    A Simple, Robust, and High Throughput Single Molecule Flow Stretching Assay Implementation for Studying Transport of Molecules Along DNA

    Published on: October 1, 2017

    8.6K

    Area of Science:

    • Biotechnology
    • Computational Biology
    • Bioinformatics

    Background:

    • Graphs are crucial for network analysis in various fields.
    • Many graph problems are NP-hard, posing computational challenges.
    • Existing DNA computing models have limited functionality.

    Purpose of the Study:

    • To propose a novel DNA computing model for solving NP-hard graph problems.
    • To demonstrate the model's versatility and feasibility through simulations and experiments.
    • To explore DNA strand displacement as a computational tool.

    Main Methods:

    • Developed a two-module DNA computing model: a graph representation module (GRM) and a detection module (DM).
    • Conducted simulation and biochemical experiments to validate the model.
    • Tested the model on NP-hard problems like minimum dominating set, maximum independent set, and minimum vertex cover.

    Main Results:

    • The GRM proved to be a universal module for graph representation.
    • Multiple graph problems were solved by cascading the GRM with designed DMs.
    • The model demonstrated feasibility for solving intractable graph problems.

    Conclusions:

    • The proposed DNA computing model offers a new approach for solving NP-hard graph problems.
    • The GRM's universality allows for solving diverse graph problems.
    • DNA strand displacement shows promise as a computational tool for complex problems.