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 Experiment Videos

Molecular solutions for the subset-sum problem on DNA-based supercomputing.

Weng-Long Chang1, Michael Shan-Hui Ho, Minyi Guo

  • 1Department of Information Management, Southern Taiwan University of Technology, Tainan County 710, Taiwan, ROC. changwl@mail.stut.edu.tw

Bio Systems
|March 12, 2004
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

Age-related dynamics of reproductive performance and egg quality in breeding pigeons.

Poultry science·2026
Same author

CT‑based radiomics of bowel wall at baseline predicts the efficacy of Ustekinumab at week 16 in patients with Crohn's disease.

Abdominal radiology (New York)·2025
Same author

Creeping fat is associated with transmural healing in patients with Crohn's disease receiving ustekinumab.

Insights into imaging·2025
Same author

An adaptive AI-based virtual reality sports system for adolescents with excess body weight: a randomized controlled trial.

Nature medicine·2025
Same author

A deep learning system for detecting silent brain infarction and predicting stroke risk.

Nature biomedical engineering·2025
Same author

Non-invasive biopsy diagnosis of diabetic kidney disease via deep learning applied to retinal images: a population-based study.

The Lancet. Digital health·2025
Same journal

Ruliological Resilience: Pattern Restoration and Robustness in Wolfram Patterns. A Basis for Regeneration, Not Just in Cone Shells?

Bio Systems·2026
Same journal

The quantum-to-classical transducer: A thermodynamic and quantum mechanical framework for the emergence of bioenergetics.

Bio Systems·2026
Same journal

Forward-backward gene expression binarization for boolean state inference over a known regulatory network.

Bio Systems·2026
Same journal

Partial-label metric ceilings for evaluating gene regulatory networks inferred from single-cell foundation models.

Bio Systems·2026
Same journal

The impedance mismatch theory: A non-equilibrium thermodynamic framework for a shared energetic stress pathway in neurodegeneration.

Bio Systems·2026
Same journal

Immune signal-status misclassification: A theoretical framework for biological status assignment and failed status resolution.

Bio Systems·2026
See all related articles

This study introduces novel DNA-based algorithms to solve the subset-sum problem. These molecular computing approaches utilize parallel adders and comparators for efficient verification.

Area of Science:

  • Computer Science
  • Molecular Computing
  • Algorithm Design

Background:

  • The subset-sum problem is a classic NP-complete problem with significant computational challenges.
  • Existing computational methods often struggle with large-scale instances of the subset-sum problem.
  • Molecular computing offers a potential paradigm shift for tackling complex combinatorial problems.

Purpose of the Study:

  • To develop and present molecular solutions for the subset-sum problem using DNA-based algorithms.
  • To introduce novel DNA-based algorithms for parallel addition and comparison.
  • To formally verify the efficacy of these molecular solutions for the subset-sum problem.

Main Methods:

  • Design of a DNA-based algorithm for an n-bit parallel adder.

Related Experiment Videos

  • Development of a DNA-based algorithm for an n-bit parallel comparator.
  • Formal verification of the proposed molecular solutions against the subset-sum problem.

    • Main Results:

    • Successful design of DNA-based algorithms for parallel addition and comparison.
    • Demonstration of molecular approaches for solving the subset-sum problem.
    • Formal verification confirming the validity of the proposed molecular solutions.

    Conclusions:

    • The proposed DNA-based algorithms offer a viable molecular computing approach to address the subset-sum problem.
    • Parallel adders and comparators are effective molecular tools for verifying subset-sum solutions.
    • This work contributes to the advancement of molecular solutions for computationally intensive problems.