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

State transitions by molecules.

K Sakamoto1, D Kiga, K Komiya

  • 1Department of Biophysics and Biochemistry, Graduate School of Science, University of Tokyo, Hongo, Japan.

Bio Systems
|January 15, 2000
PubMed
Summary

This study demonstrates DNA computing can solve complex problems using a single series of state transitions. Isothermal reactions and unnatural bases enhance efficiency and prevent errors in DNA-based computation.

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

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

Molecular computation by DNA hairpin formation.

Science (New York, N.Y.)·2000
Same author

An RNA aptamer to the xanthine/guanine base with a distinctive mode of purine recognition.

Nucleic acids research·1998
Same author

Site-specific cleavage of tRNA by imidazole and/or primary amine groups bound at the 5'-end of oligodeoxyribonucleotides.

Biochimica et biophysica acta·1998
Same author

Long-term follow-up of minimal residual disease in leukemia patients by monitoring WT1 (Wilms tumor gene) expression levels.

Blood·1996
Same author

Catalytic activities of hammerhead ribozymes with a triterpenoid linker instead of stem/loop II.

FEBS letters·1996

Area of Science:

  • Biochemistry
  • Computational Biology
  • Molecular Computing

Background:

  • Previous work established DNA state machines where the 3'-end sequence encodes the current state.
  • State transitions involve annealing the current state to a transition table and extending the next state with polymerase.

Purpose of the Study:

  • To show that DNA state machines, combined with parallel overlap assembly, can solve NP-complete problems.
  • To report experimental results on improving the efficiency and reliability of DNA-based state transitions.

Main Methods:

  • Utilizing parallel overlap assembly with DNA state machines to address NP-complete problems.
  • Implementing isothermal reactions for enhanced state transition efficiency.
  • Employing unnatural bases to prevent out-of-frame annealing.

Related Experiment Videos

Main Results:

  • A single series of DNA state transitions can solve NP-complete problems, independent of problem size.
  • Isothermal reactions significantly improve state transition efficiency over thermal cycling.
  • Unnatural bases effectively prevent out-of-frame annealing, a finding applicable to broader DNA computing.

Conclusions:

  • DNA state machines offer a scalable approach to solving complex computational problems.
  • Optimized reaction conditions (isothermal) and base modifications (unnatural bases) are crucial for efficient and accurate DNA computing.