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

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Graphical Representation of Inequalities01:28

Graphical Representation of Inequalities

The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all points...
Castigliano's Theorem: Problem Solving01:14

Castigliano's Theorem: Problem Solving

The deflection of a simply supported beam that carries a central point load can be analyzed using structural mechanics principles, particularly by applying Castigliano's theorem. This theorem relates the displacement at the load application point to the partial derivatives of the strain energy in the structure. The simply supported beam with a point load at its center has symmetric reaction forces at the supports, each bearing half of the load. The bending moment at any point along the beam is...
Synthetic Disvision of Polynomials01:28

Synthetic Disvision of Polynomials

Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...
DNA as a Genetic Template02:05

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...
DNA as a Genetic Template02:05

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

Central and peripheral neuromuscular mechanisms underlying functional recovery heterogeneity in tibial plateau fractures.

iScience·2026
Same author

Effects of OsNRT2.3b transgenosis on lettuce antioxidant capacity and nitrogen metabolism under low nitrogen.

PloS one·2026
Same author

A meta-analysis of the effects of Baduanjin training on the human body temperature based on infrared thermography technology.

Medicine·2026
Same author

Genome-wide investigation of the cytochrome P450 superfamily in lettuce (Lactuca sativa L.) and functional analysis of LsCYP703A in regulating pollen wall development.

International journal of biological macromolecules·2026
Same author

Cell-autonomous co-stimulatory function of membrane-bound CD100 promotes activation and differentiation of HBcAg-specific CD8<sup>+</sup> T cells.

Frontiers in immunology·2026
Same author

Ag-CuO Nanozymes Superior to Commercial Silver-Based Dressings: Synergistic Antibacterial Therapy via PTS-Mediated Starvation and Cuproptosis-Like Death.

Research (Washington, D.C.)·2026
Same journal

Investigating Effect of Dimensional Variance on Separation of Glomerular Ultrafiltrate in a Microfluidic Environment.

IEEE transactions on nanobioscience·2026
Same journal

Green synthesis of multifunctional ZnFe<sub>2</sub>O<sub>4</sub>-MWCNT-Cellulose acetate nanocomposite for peroxidase enzyme immobilization.

IEEE transactions on nanobioscience·2026
Same journal

IoT-Enabled SnO₂-Based Humidity Sensor for Real-Time Monitoring in Neonatal Incubators.

IEEE transactions on nanobioscience·2026
Same journal

Electrokinetic and Antibiofilm Effects of Silver Nanoparticles Combined with Imipenem Against multidrug-resistant of Klebsiella pneumoniae.

IEEE transactions on nanobioscience·2026
Same journal

Bio-inspired Optofluidic Molecular Communication with Photothermally Actuated Microrobot Swarms.

IEEE transactions on nanobioscience·2026
Same journal

Nanostructured ZnO Thin Film-Based Enzymatic Biosensor for Sensitive Acetylcholine Detection in Neurological Applications.

IEEE transactions on nanobioscience·2026
See all related articles

Related Experiment Video

Updated: May 31, 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

An unenumerative DNA computing model for vertex coloring problem.

Jin Xu1, Xiaoli Qiang, Yan Yang

  • 1Key Laboratory of High Confidence Software Technologies of Ministry of Education, School of Electronics Engineering and Computer Science, Peking University, Beijing, China. jxu@pku.edu.cn

IEEE Transactions on Nanobioscience
|July 12, 2011
PubMed
Summary
This summary is machine-generated.

This study introduces a novel DNA computing model to overcome solution space explosion in graph vertex coloring. The unenumerative approach significantly reduces DNA strands needed, enhancing computational efficiency.

More Related Videos

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Related Experiment Videos

Last Updated: May 31, 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

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Computer Science

Background:

  • DNA computing offers potential for solving complex problems.
  • Exponential growth in solution space is a major challenge in DNA computing, particularly for graph problems.

Purpose of the Study:

  • To present a new unenumerative DNA computing model for the graph vertex coloring problem.
  • To reduce the computational complexity and solution space size in DNA-based graph coloring.

Main Methods:

  • Developed an unenumerative DNA computing model.
  • Employed a vertex ordering technique to maximize adjacency between consecutive vertices.
  • Implemented a color encoding reduction strategy based on graph structure.

Main Results:

  • Successfully solved a 12-vertex graph coloring problem.
  • Reduced the initial solution space to 283 DNA strands.
  • Achieved a significant reduction in complexity compared to the worst-case scenario (0.0532 of 3^12).

Conclusions:

  • The proposed unenumerative DNA computing model effectively addresses the solution space explosion problem.
  • This approach offers a more efficient method for DNA-based graph vertex coloring.
  • The techniques show promise for tackling larger and more complex graph problems using DNA computing.