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

Length bounded molecular computing.

B Fu1, R Beigel

  • 1Epson Palo Alto Laboratory, Epson Research and Development, Inc., Palo Alto, CA 94304, USA. fu.bin@erd.epson.com

Bio Systems
|January 15, 2000
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

Prognostic nomogram for patients with HER2-negative metastatic gastric cancer receiving first-line PD-1 blockade.

ESMO open·2026
Same author

Fully guided, flapless zygomatic implants for oncological rehabilitation-a technical note.

International journal of oral and maxillofacial surgery·2025
Same author

In-depth Occlusion of Dentinal Tubules Induced by Polyaspartic Acid-Calcium and Magnesium Complexes.

Journal of dental research·2025
Same author

Hypertension and its association to phenotype on left ventricular function in hypertrophic cardiomyopathy patients assessed by cardiovascular magnetic resonance imaging.

Clinical radiology·2024
Same author

Performance of Bonded Lithium Disilicate Partial-coverage Crowns in the Restoration of Endodontically Treated Posterior Teeth: An Up to Seven-Year Retrospective Study.

Operative dentistry·2024
Same author

[A sericin hydrogel scaffold for sustained dexamethasone release modulates macrophage polarization to promote mandibular bone defect repair in rats].

Nan fang yi ke da xue xue bao = Journal of Southern Medical University·2024
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

Researchers optimized DNA computing algorithms for NP-complete problems like 3-SAT. They reduced DNA strand lengths, maintaining efficiency for DNA strand length reduction in molecular computing.

Area of Science:

  • Biomolecular Computing
  • Computational Complexity Theory
  • Molecular Biology

Background:

  • DNA strand length is a critical resource in DNA computing.
  • Efficiently solving NP-complete problems remains a significant challenge.

Purpose of the Study:

  • To decrease DNA strand lengths in molecular algorithms for NP-complete problems.
  • To maintain or minimize increases in running time and volume during optimization.

Main Methods:

  • Modification of existing molecular algorithms for NP-complete problems.
  • Analysis of DNA strand length reduction techniques.
  • Evaluation of computational resource usage (time and volume).

Main Results:

  • Successfully reduced DNA strand lengths for algorithms addressing 3-SAT and Independent Set problems.

Related Experiment Videos

  • Demonstrated that strand length reduction does not substantially increase running time or volume.

    • Conclusions:

    • Optimized DNA computing algorithms offer a more resource-efficient approach to solving complex problems.
    • This work advances the practical application of DNA computing for computationally intensive tasks.