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

Chess games: a model for RNA based computation.

A R Cukras1, D Faulhammer, R J Lipton

  • 1Department of Ecology and Evolutionary Biology, Princeton University, NJ 08542, USA.

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

Evolution: Lost worlds.

Trends in ecology & evolution·2011
Same author

RNA catalysis in frozen solutions.

Doklady. Biochemistry and biophysics·2005
Same author

How mitochondria redefine the code.

Journal of molecular evolution·2001
Same author

The evolution of cellular computing.

The Biological bulletin·2001
Same author

The past, present and future of molecular computing.

Nature reviews. Molecular cell biology·2001
Same author

Fidelity of enzymatic ligation for DNA computing.

Journal of computational biology : a journal of computational molecular cell biology·2001
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 developed RNA computing to solve the knight problem, a type of satisfiability (SAT) problem. This biological method shows promise, recovering more correct solutions than random chance, though errors remain a challenge.

Area of Science:

  • Biotechnology
  • Computational Biology
  • Molecular Computing

Background:

  • Satisfiability (SAT) problems are fundamental in computer science.
  • Biological molecules offer a novel platform for computation.
  • RNA molecules can be programmed to perform logical operations.

Purpose of the Study:

  • To establish the theory and practice of RNA computing.
  • To demonstrate RNA computing's capability in solving complex problems.
  • To address the 'knight problem' using a biological approach.

Main Methods:

  • Developed a novel RNA computing algorithm.
  • Utilized a 10-bit combinatorial pool of RNA molecules.
  • Employed sequential RNase H digestions for computation.

Related Experiment Videos

  • Applied biological molecules and enzymes as computational tools.
  • Main Results:

    • Successfully implemented an RNA-based algorithm for the knight problem.
    • Preliminary experiments showed a higher recovery rate of correct solutions than random chance.
    • Identified persistent errors as a significant challenge in the current protocol.

    Conclusions:

    • RNA computing is a viable approach for solving satisfiability problems.
    • The developed method demonstrates proof-of-concept for biological computation.
    • Further optimization is required to improve accuracy and reduce errors in RNA computing.