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

The bounded complexity of DNA computing.

M H Garzon1, N Jonoska, S A Karl

  • 1Department of Computer Science, University of Memphis, TN 38152, USA. garzonm@memphis.edu

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

Counter machines and crystallographic structures.

Natural computing·2016
Same author

Molecular ping-pong Game of Life on a two-dimensional DNA origami array.

Philosophical transactions. Series A, Mathematical, physical, and engineering sciences·2015
Same author

Population genetic structure of Earth's largest fish, the whale shark (Rhincodon typus).

Molecular ecology·2007
Same author

Population genetics and phylogeography of sea turtles.

Molecular ecology·2007
Same author

Evolutionary history of the parrotfishes: biogeography, ecomorphology, and comparative diversity.

Evolution; international journal of organic evolution·2002
Same author

Evolution of poecilogony and the biogeography of North American populations of the polychaete Streblospio.

Evolution; international journal of organic evolution·2000
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
Same journal

Contextuality, incompatibility, and intra-system entanglement of mental markers: From cognition and decision making to medicine.

Bio Systems·2026
See all related articles

This study introduces a new method for analyzing DNA computing algorithms by defining complexity based on molecular operations. New DNA algorithms for Hamiltonian path and Max-Clique show significant efficiency gains.

Area of Science:

  • Molecular Computation
  • Biocomputing
  • DNA Algorithms

Background:

  • Molecular computation utilizes DNA molecules for data processing.
  • Existing protocols involve encoding, tube operations, and extraction.
  • Physical attributes of tubes and elementary operations influence computation.

Purpose of the Study:

  • To propose a novel approach for analyzing DNA-based algorithms.
  • To define algorithm complexity using physico-chemical properties of operations.
  • To evaluate the efficiency of new DNA computing algorithms.

Main Methods:

  • Abstract characterization of DNA computing protocols.
  • Definition of complexity based on realistic elementary operations.
  • Analysis of encoding, tube operations, and extraction processes.

Related Experiment Videos

Main Results:

  • New Hamiltonian path algorithms are approximately twice as efficient as Adleman's original.
  • A recent Max-Clique algorithm demonstrates a similar increase in efficiency.
  • The proposed complexity measure provides insights into DNA computing.

Conclusions:

  • The new approach offers a more accurate assessment of DNA algorithm complexity.
  • Enhanced efficiency in DNA computing is achievable with optimized algorithms.
  • This work has implications for the field of molecular computation.