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

DNA as a Genetic Template02:05

DNA as a Genetic Template

28.3K
Two structural features of the DNA molecule provide a basis for the mechanisms of heredity: the four nucleotide bases and its double-stranded nature. The Watson-Crick model of double-helical DNA structure, proposed in 1952, drew heavily upon the X-ray crystallography work of researchers Rosalind Franklin and Maurice Wilkins. Watson, Crick, and Wilkins jointly received the Nobel Prize in Physiology or Medicine for their work in 1962. Franklin was, controversially, excluded from the prize for...
28.3K
DNA Agarose Gel Electrophoresis02:35

DNA Agarose Gel Electrophoresis

116.7K
Agarose gel electrophoresis is a laboratory technique commonly used to separate DNA fragments by size. However, it can also be used to isolate and purify DNA fragments using a gel extraction protocol.
Gel extraction follows five major steps: running gel electrophoresis to separate fragments, isolating the individual bands, extracting DNA from those bands, and removing the dye and salts from the extracted mixture to obtain pure DNA.
In cloning experiments, both the insert and vector DNA...
116.7K
Southern Blot02:57

Southern Blot

23.6K
Agarose gel electrophoresis is very useful in separating DNA fragments by size. Running a DNA ladder containing fragments of the known length alongside the sample helps determine the approximate length of the sample DNA fragments. However, additional steps are needed to verify the sequence identity of the sample DNA fragments.
Denatured DNA fragments must be transferred onto a carrier membrane from the gel to make it accessible to a probe - a small ssDNA fragment complementary to the target DNA...
23.6K

You might also read

Related Articles

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

Sort by
Same author

Molecular dynamics insights into dimerization-dependent catalysis and thermal adaptation of mesophilic ketosteroid isomerase from Pseudomonas putida.

Journal of molecular graphics & modelling·2025
Same author

Design and synthesis of polyhydroxylated azabicyclo[3.3.1]nonane as selective lysosomal α-glucosidase stabilizers enhancing cellular uptake.

Bioorganic chemistry·2025
Same author

Loss of estrogen receptor alpha promotes distant metastasis through epithelial-mesenchymal transition in luminal-type breast cancer.

Biochimica et biophysica acta. Molecular basis of disease·2025
Same author

Structural and functional characterization of Pin1BP1: A novel Pin1-interacting protein regulating apoptosis.

International journal of biological macromolecules·2025
Same author

Structural impacts of two disease-linked ADAR1 mutants: a molecular dynamics study.

Journal of computer-aided molecular design·2024
Same author

A novel long non-coding RNA MIR4500HG003 promotes tumor metastasis through miR-483-3p-MMP9 axis in triple-negative breast cancer.

Cell death & disease·2024

Related Experiment Video

Updated: Mar 1, 2026

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes
08:35

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes

Published on: July 17, 2021

23.3K

A DNA solution of SAT problem by a modified sticker model.

Chia-Ning Yang1, Chang-Biau Yang

  • 1Department of Medical Radiation Technology, I-Shou University, No. 1, Section 1, Hsueh-Cheng Road, Ta-Hsu Hsiang, Kaohsiung 840, Taiwan. cnyang@isu.edu.tw

Bio Systems
|May 27, 2005
PubMed
Summary

This study introduces a novel DNA computing algorithm for the Satisfiability (SAT) problem. It bypasses large initial data pools, offering a scalable solution for complex computational challenges.

More Related Videos

Determining if DNA Stained with a Cyanine Dye Can Be Digested with Restriction Enzymes
06:58

Determining if DNA Stained with a Cyanine Dye Can Be Digested with Restriction Enzymes

Published on: February 2, 2018

9.3K
Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles
10:23

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles

Published on: May 8, 2015

12.2K

Related Experiment Videos

Last Updated: Mar 1, 2026

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes
08:35

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes

Published on: July 17, 2021

23.3K
Determining if DNA Stained with a Cyanine Dye Can Be Digested with Restriction Enzymes
06:58

Determining if DNA Stained with a Cyanine Dye Can Be Digested with Restriction Enzymes

Published on: February 2, 2018

9.3K
Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles
10:23

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles

Published on: May 8, 2015

12.2K

Area of Science:

  • Computational Biology
  • Theoretical Computer Science
  • Molecular Computing

Background:

  • Traditional DNA computing algorithms for problems like SAT often rely on generating a vast initial pool of potential solutions.
  • This brute-force approach becomes computationally infeasible as the problem size (number of parameters) increases due to exponential data pool growth.
  • Existing methods face limitations in scalability for complex computational problems.

Purpose of the Study:

  • To develop a modified DNA computing algorithm for the Satisfiability (SAT) problem that overcomes the limitations of large initial data pools.
  • To design a more scalable and practical DNA-based approach for solving Boolean formulas.
  • To enhance the efficiency of DNA computing for problems with a growing number of parameters.

Main Methods:

  • Modification of a well-established sticker model for DNA computing.
  • Development of an algorithm that constructs solution sequences incrementally, satisfying one clause at a time.
  • Elimination of the requirement for a massive initial data pool covering all possible answers.

Main Results:

  • The proposed algorithm builds solutions step-by-step, addressing clauses sequentially.
  • The data pool size dynamically grows based on the number of solution assignments, not the initial problem complexity.
  • Demonstrates a theoretical framework for a more efficient DNA computing approach to SAT.

Conclusions:

  • The novel DNA computing algorithm offers a promising alternative for solving the SAT problem.
  • This approach is expected to be more practical for larger problem instances compared to traditional methods.
  • The incremental solution construction method enhances scalability in DNA-based computation.