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 computation by DNA hairpin formation.

K Sakamoto1, H Gouzu, K Komiya

  • 1Department of Biophysics and Biochemistry, Graduate School of Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033, Japan.

Science (New York, N.Y.)
|May 20, 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

Leak-free million-fold DNA amplification with locked nucleic acid and targeted hybridization in one pot.

Organic & biomolecular chemistry·2019
Same author

Pattern edge color difference in a color image sensor with a GRIN rod lens.

Applied optics·2010
Same author

A simple fibreoptic assisted laryngoscope for paediatric difficult intubation: a manikin study.

Anaesthesia·2009
Same author

Evaluation of intraoperative infusion solution using a complete anhepatic model in baby pigs.

Transplantation proceedings·2005
Same author

Shifted positioning of the anticodon nucleotide residues of amber suppressor tRNA species by Escherichia coli arginyl-tRNA synthetase.

European journal of biochemistry·2001
Same author

The rabies virion-associated 100-kDa polypeptide (VAP100) is a host-derived minor component of the viral envelope.

Microbiology and immunology·2000

DNA hairpin formation enables autonomous molecular computing to solve complex problems like the satisfiability problem. This DNA computation method efficiently tests multiple formula clauses simultaneously, reducing laboratory steps.

Area of Science:

  • Molecular computing
  • Computational biology
  • Bioinformatics

Background:

  • Autonomous molecular computing offers a novel paradigm for complex problem-solving.
  • DNA-based computation leverages the unique properties of DNA molecules for information processing.
  • The satisfiability problem is a well-known computationally hard problem in computer science.

Purpose of the Study:

  • To explore the feasibility of autonomous molecular computing using DNA hairpin formation.
  • To demonstrate a DNA-based computation approach for solving the satisfiability problem.
  • To investigate the efficiency of DNA computation for handling combinatorial problems.

Main Methods:

  • Utilizing single-stranded DNA molecules engineered to form specific hairpin structures.

Related Experiment Videos

  • Developing a DNA computation algorithm based on hairpin formation to represent Boolean formulas.
  • Employing molecular biology techniques to execute the DNA-based computation.

    • Main Results:

    • Successfully demonstrated autonomous computation through DNA hairpin formation.
    • Solved an instance of the satisfiability problem using the developed molecular approach.
    • The algorithm showed the capability to test multiple clauses concurrently.

    Conclusions:

    • DNA hairpin formation is a viable mechanism for autonomous molecular computing.
    • This DNA computation strategy offers potential for efficient solutions to hard combinatorial problems.
    • The simultaneous clause testing capability could significantly streamline laboratory processes.