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

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

100
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...
100
Biot-Savart Law: Problem-Solving00:59

Biot-Savart Law: Problem-Solving

2.8K
The magnitude and direction of a magnetic field created by a steady current can be calculated using the Biot-Savart law.
Consider a mobile phone battery bank as a source of steady current, which flows through the wire connected between the two. What is the magnitude of the magnetic field created by this current at a field point P?
To estimate the magnitude of the total magnetic field, we first consider a small current element of length dl, at a distance r from the field point. Now the following...
2.8K
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

6.1K
Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
6.1K

You might also read

Related Articles

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

Sort by
Same author

Association Between Pharmacological Treatment Regimens and Quality of Life Among Rural Type 2 Diabetic Patients: A Comparative Analysis in Eastern China.

Inquiry : a journal of medical care organization, provision and financing·2024
Same author

Amyloid-β predominant Alzheimer's disease neuropathologic change.

Brain : a journal of neurology·2024
Same author

Expression of histone methyltransferase WHSC1 in invasive breast cancer and its correlation with clinical and pathological data.

Pathology, research and practice·2024
Same author

Roadmap on magnetic nanoparticles in nanomedicine.

Nanotechnology·2024
Same author

Sedimentary antimony stable isotope record of anthropogenic contamination in a karst lake in southwestern China.

The Science of the total environment·2024
Same author

Heat shock cognate 70 protein is a novel target of nobiletin and its colonic metabolites in inhibiting colon carcinogenesis.

Food & function·2024
Same journal

RETRACTION: Multidimensional Heterogeneous Network Link Adaptation Based on Mobile Environment.

Computational intelligence and neuroscience·2026
Same journal

RETRACTION: Framework to Segment and Evaluate Multiple Sclerosis Lesion in MRI Slices Using VGG-UNet.

Computational intelligence and neuroscience·2026
Same journal

RETRACTION: Facial Emotion Recognition Using a Novel Fusion of Convolutional Neural Network and Local Binary Pattern in Crime Investigation.

Computational intelligence and neuroscience·2026
Same journal

RETRACTION: Automatic Intelligent System Using Medical of Things for Multiple Sclerosis Detection.

Computational intelligence and neuroscience·2026
Same journal

RETRACTION: Intangible Cultural Heritage Reproduction and Revitalization: Value Feedback, Practice, and Exploration Based on the IPA Model.

Computational intelligence and neuroscience·2026
Same journal

RETRACTION: CNN Based Multiclass Brain Tumor Detection Using Medical Imaging.

Computational intelligence and neuroscience·2025
See all related articles

Related Experiment Video

Updated: Aug 29, 2025

A Fast and Quantitative Method for Post-translational Modification and Variant Enabled Mapping of Peptides to Genomes
09:10

A Fast and Quantitative Method for Post-translational Modification and Variant Enabled Mapping of Peptides to Genomes

Published on: May 22, 2018

9.3K

A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model.

Zhaocai Wang1, Xian Wu1, Tunhua Wu2

  • 1College of Information, Shanghai Ocean University, Shanghai 201306, China.

Computational Intelligence and Neuroscience
|September 12, 2022
PubMed
Summary
This summary is machine-generated.

Researchers developed a novel DNA algorithm to solve the quota traveling salesman problem (QTSP), achieving polynomial time complexity. This DNA computing approach offers significant advantages over traditional methods for complex optimization tasks.

More Related Videos

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.4K
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.3K

Related Experiment Videos

Last Updated: Aug 29, 2025

A Fast and Quantitative Method for Post-translational Modification and Variant Enabled Mapping of Peptides to Genomes
09:10

A Fast and Quantitative Method for Post-translational Modification and Variant Enabled Mapping of Peptides to Genomes

Published on: May 22, 2018

9.3K
A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.4K
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.3K

Area of Science:

  • Computational Biology
  • Operations Research
  • Bioinformatics

Background:

  • The quota traveling salesman problem (QTSP) is a complex optimization challenge.
  • Existing algorithms for QTSP often have exponential time complexity, limiting their scalability.
  • Efficient solutions are needed for problems involving sales quotas and minimized travel costs.

Purpose of the Study:

  • To develop a novel DNA algorithm for solving the quota traveling salesman problem (QTSP).
  • To achieve a polynomial time complexity for the QTSP, improving upon existing exponential algorithms.
  • To demonstrate the feasibility and advantages of DNA computing for complex optimization problems.

Main Methods:

  • Developed a DNA algorithm based on the Adleman-Lipton model.
  • Implemented a specific coding scheme for element information.
  • Utilized limited conditions to design a biological algorithm.

Main Results:

  • Achieved a time complexity of O(n^2+Q) for the QTSP, a significant improvement.
  • Verified the algorithm's feasibility through simulation experiments.
  • Demonstrated the potential for DNA computing to solve NP-hard problems efficiently.

Conclusions:

  • The proposed DNA algorithm offers a polynomial time solution for the QTSP.
  • This approach provides substantial advantages in speed and scalability compared to exponential algorithms.
  • DNA computing presents a promising parallel processing method for complex optimization challenges with large storage capacity and low energy consumption.