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

Computing with DNA by operating on plasmids.

T Head1, G Rozenberg, R S Bladergroen

  • 1Department of Mathematical Sciences, Binghamton University, Binghamton, NY 13902-6000, USA.

Bio Systems
|September 27, 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

Symmetric expression of ohnologs encoding conserved antiviral responses in tetraploid common carp suggest absence of subgenome dominance after whole genome duplication.

Genomics·2023
Same author

Odderon Exchange from Elastic Scattering Differences between pp and pp[over ¯] Data at 1.96 TeV and from pp Forward Scattering Measurements.

Physical review letters·2021
Same author

Improved limit on the branching fraction of the rare decay <math> </math>.

The European physical journal. C, Particles and fields·2020
Same author

Updated search for long-lived particles decaying to jet pairs.

The European physical journal. C, Particles and fields·2020
Same author

Study of charmonium production in <math></math> -hadron decays and first evidence for the decay <math> </math>.

The European physical journal. C, Particles and fields·2020
Same author

Measurement of the Effective Weak Mixing Angle in pp[over ¯]→Z/γ^{*}→ℓ^{+}ℓ^{-} Events.

Physical review letters·2018
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 a novel DNA plasmid computing method to solve complex graph problems. This molecular computing approach successfully determined the size of maximal independent sets in a graph.

Area of Science:

  • Molecular Computing
  • Bioinformatics
  • Computational Biology

Background:

  • Algorithmic problems, particularly NP-complete ones, pose significant computational challenges.
  • DNA-based molecular computing offers a potential alternative to traditional electronic computation.
  • Previous molecular computing methods have explored various DNA structures and reactions.

Purpose of the Study:

  • To introduce a new method for molecular computing utilizing specifically designed DNA plasmids.
  • To demonstrate the feasibility of this method by solving an NP-complete problem.
  • To highlight the potential advantages of DNA plasmid-based computation.

Main Methods:

  • Construction of a circular DNA plasmid engineered with specific DNA sequence segments and restriction enzyme sites.

Related Experiment Videos

  • Representation of graph vertices using these DNA sequence segments.
  • Application of enzymatic treatments to modify the plasmids and derive the computational solution.

    • Main Results:

    • Successful laboratory computation of the cardinal number of a maximal independent set for a given graph.
    • Demonstration of a novel molecular computing approach using enzymatic manipulation of DNA plasmids.
    • Validation of the DNA sequence segments and restriction sites for representing graph properties.

    Conclusions:

    • The developed DNA plasmid computing method is a viable approach for solving complex algorithmic problems.
    • This molecular computing strategy shows promise for tackling a wide range of computational challenges.
    • Further research and computations using this DNA-based method are ongoing.