Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

DNA Packaging

DNA Packaging

DNA Packaging

DNA Packaging

The DNA Helix

The DNA Helix

Deoxyribonucleic acid, or DNA, is the genetic material responsible for passing traits from generation to generation in all organisms and most viruses. DNA is composed of two strands of nucleotides that wind around each other to form a spring-like structure called a double helix. However, the double helix is not perfectly symmetrical. Instead, there are regularly occurring grooves in the structure. The major groove occurs where the sugar-phosphate backbones are relatively far apart. This space...

The DNA Helix

The DNA Helix

The Central Dogma

The Central Dogma

The central dogma explains the flow of genetic information from DNA nucleotides to the amino acid sequence of proteins.
RNA is the Missing Link Between DNA and Proteins
In the early 1900s, scientists discovered that DNA stores all the information needed for cellular functions and that proteins perform most of these functions. However, the mechanisms of converting genetic information into functional proteins remained unknown for many years. Initially, it was believed that a single gene is...

DNA as a Genetic Template

DNA as a Genetic Template

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

You might also read

Related Articles

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

Sort by

Same author

The impact of exposure to fluoride in drinking water on intelligence in school age children in Iran.

Scientific reports·2026

Same author

Right Atrium Large Masses Due to Endocarditis Following Permcath Insertion After Covid-19-Induced Renal Failure.

Iranian journal of pathology·2026

Same author

Microplastics in small semi-industrial desalination stations and bottled waters: Human exposure and emerging health concerns.

The Science of the total environment·2026

Same author

OM4AnI: A Novel Overlap Measure for Anomaly Identification in Multi-Class Scatterplots.

IEEE transactions on visualization and computer graphics·2025

Same author

Analysis of the distraction impact on driving performance across driving styles: A driving simulator study in various speed conditions.

PloS one·2025

Same author

Presence of microplastics in human's respiratory system: bronchoalveolar and bronchial lavage fluid.

Journal of environmental health science & engineering·2025

Search research articles

Related Experiment Video

Updated: May 13, 2026

Folding and Characterization of a Bio-responsive Robot from DNA Origami

Folding and Characterization of a Bio-responsive Robot from DNA Origami

Published on: December 3, 2015

Solving the 0/1 knapsack problem by a biomolecular DNA computer.

Hassan Taghipour¹, Mahdi Rezaei, Heydar Ali Esmaili

¹Department of Pathology, Tabriz University of Medical Sciences, Tabriz, Iran.

Advances in Bioinformatics

|March 20, 2013

Summary

This summary is machine-generated.

DNA computing offers a powerful alternative for solving complex mathematical problems like the knapsack problem. This sticker-based DNA computing approach solves NP-complete problems efficiently, outperforming traditional computers.

More Related Videos

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

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

Published on: December 29, 2021

Designing a Bio-responsive Robot from DNA Origami

Designing a Bio-responsive Robot from DNA Origami

Published on: July 8, 2013

Related Experiment Videos

Last Updated: May 13, 2026

Folding and Characterization of a Bio-responsive Robot from DNA Origami

Folding and Characterization of a Bio-responsive Robot from DNA Origami

Published on: December 3, 2015

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

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

Published on: December 29, 2021

Designing a Bio-responsive Robot from DNA Origami

Designing a Bio-responsive Robot from DNA Origami

Published on: July 8, 2013

Area of Science:

Biocomputing
Computational Complexity
Molecular Computing

Background:

Conventional silicon-based computers struggle with NP-complete problems, requiring extensive computation time.
DNA computing leverages the massive parallel processing capabilities of DNA molecules as an alternative.
NP-complete and hard combinatorial problems are well-suited for DNA computing due to inherent parallelism.

Purpose of the Study:

To apply sticker-based DNA computing for solving the 0/1 knapsack problem.
To demonstrate the efficiency of DNA computing for combinatorial optimization.
To explore biomolecular solutions for computationally intensive mathematical challenges.

Main Methods:

Construction of a biomolecular solution space using DNA memory complexes.
Application of a sticker-based parallel algorithm utilizing biological operations.
Solving the 0/1 knapsack problem through molecular computation.

Main Results:

The 0/1 knapsack problem was successfully resolved using sticker-based DNA computing.
The DNA computing approach achieved a solution in polynomial time.
Demonstrated significant speed advantage over conventional computing methods for this problem.

Conclusions:

Sticker-based DNA computing is an effective method for solving NP-complete problems like the knapsack problem.
DNA computers offer a viable and efficient alternative for tackling complex combinatorial challenges.
This research highlights the potential of molecular computing in computational mathematics.