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

Solving the 3-SAT problem based on DNA computing.

Wenbin Liu1, Lin Gao, Xiangrong Liu

  • 1Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan City 430074, China. wbliu@mail.hust.edu.cn

Journal of Chemical Information and Computer Sciences
|November 25, 2003
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

What does UHC mean?

Lancet (London, England)·2014
Same author

Thyroid-stimulating hormone maintains bone mass and strength by suppressing osteoclast differentiation.

Journal of biomechanics·2014
Same author

[Risk factors of shunt-dependent hydrocephalus after aneurysmal subarachnoid hemorrhage].

Zhejiang da xue xue bao. Yi xue ban = Journal of Zhejiang University. Medical sciences·2014
Same author

Reproducibility of diffusion tensor imaging in normal subjects: an evaluation of different gradient sampling schemes and registration algorithm.

Neuroradiology·2014
Same author

Upregulation and lysosomal degradation of AQP4 in rat brains with bacterial meningitis.

Neuroscience letters·2014
Same author

Identification, immunolocalization, and immunological characterization of nitric oxide synthase-interacting protein from Clonorchis sinensis.

Parasitology research·2014
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
See all related articles

This study introduces a novel DNA computing algorithm for the 3-SAT problem, significantly reducing the number and length of literal strings. This DNA computing approach offers a more efficient method for solving this NP-complete problem.

Area of Science:

  • * Computer Science
  • * Computational Biology
  • * Bioinformatics

Background:

  • * The 3-SAT problem is a well-known NP-complete problem, posing significant computational challenges.
  • * DNA computing offers a unique paradigm for addressing complex computational problems.
  • * Adleman's pioneering work established DNA computing as a viable approach for problems like 3-SAT.

Purpose of the Study:

  • * To present a novel DNA computing algorithm for solving the 3-SAT problem.
  • * To improve the efficiency of DNA-based 3-SAT solvers by optimizing literal string management.
  • * To evaluate the performance of the new algorithm through simulation.

Main Methods:

  • * Development of a new algorithm based on the literal string strategy.
  • * Simulation of the proposed algorithm to analyze its computational process.

Related Experiment Videos

  • * Comparison of the new algorithm's resource requirements against existing methods.

    • Main Results:

    • * Significant reduction in the maximal number of literal strings generated during computation.
    • * Reduction in the length of literal strings, from m to at most n.
    • * Demonstrated improved efficiency in the DNA computing process for 3-SAT.

    Conclusions:

    • * The proposed DNA computing algorithm offers a more efficient solution for the 3-SAT problem.
    • * Optimization of literal string handling in DNA computing leads to enhanced performance.
    • * This work contributes to the advancement of DNA computing applications in solving NP-complete problems.