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

DNA computing based on splicing: universality results

E Csuhaj-Varjú1, R Freund, L Kari

  • 1Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|January 1, 1996
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

A self-referenced optical phase noise analyzer for quantum technologies.

The Review of scientific instruments·2024
Same author

Bioelectrical impedance in young patients with cystic fibrosis: Validation of a specific equation and clinical relevance.

Journal of cystic fibrosis : official journal of the European Cystic Fibrosis Society·2016
Same author

A Chlamydia trachomatis strain with a chemically generated amino acid substitution (P370L) in the cthtrA gene shows reduced elementary body production.

BMC microbiology·2015
Same author

Measles immunity and measles vaccine acceptance among healthcare workers in Paris, France.

The Journal of hospital infection·2013
Same author

Improving implementation of infection control guidelines to reduce nosocomial infection rates: pioneering the report card.

The Journal of hospital infection·2012
Same author

Performance comparison of MSK and QPSK optical long haul DWDM transmission with coherent detection.

Optics express·2012
Same journal

Trust, Reproducibility, and Progress: The Roles of Independent Blind Prediction and Assessment and Benchmarking in Computational Biology.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

The Evolving Cyberinfrastructure at the National Institutes of Health to Support Data and AI in Biomedical Research.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Applications of AI & ML in Biomanufacturing of Cell and Gene Therapies.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

AI for Health: Leveraging Artificial Intelligence to Revolutionize Healthcare.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Workshop Introduction: Advances of AI Methods in Single Cell Spatial Omics.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

DRIVE-KG: Enhancing variant-phenotype association discovery in understudied complex diseases using heterogeneous knowledge graphs.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
See all related articles

This study demonstrates the theoretical possibility of creating programmable universal DNA computers using H systems with finite splicing rules and axioms. These systems can simulate Turing machines and generate recursively enumerable languages, paving the way for biological computing.

Area of Science:

  • Theoretical Computer Science
  • Biomolecular Computing
  • Formal Language Theory

Background:

  • H systems, inspired by DNA splicing, are a model of computation.
  • Previous research explored the computational universality of specific H system variants.
  • Understanding the full computational power of H systems is crucial for DNA computing.

Purpose of the Study:

  • To prove the computational universality of H systems with finite sets of rules and axioms.
  • To demonstrate the feasibility of designing programmable universal DNA computers.
  • To characterize recursively enumerable languages using H systems and test tube systems.

Main Methods:

  • Extending existing results on H system universality.
  • Simulating Turing machines with H systems operating in multiset style.

Related Experiment Videos

  • Introducing control mechanisms for H systems as language generators.
  • Developing universal test tube systems.

    • Main Results:

    • Construction of universal computers based on H systems with finite splicing rules and axioms.
    • Equivalence established between Turing machines and H systems for partial recursive function computation.
    • Characterization of recursively enumerable languages using controlled H systems.
    • Demonstration of universal test tube systems for biological computing.

    Conclusions:

    • H systems with finite rules and axioms are computationally universal.
    • Programmable universal DNA computers can be designed using H systems.
    • Test tube systems offer a theoretical basis for biological computers.