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 computation: theory, practice, and prospects.

C C Maley1

  • 1Department of Computer Science, University of New Mexico, Albuquerque 87131, USA. cmaley@cs.unm.edu

Evolutionary Computation
|February 18, 1999
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

Exploring the relationship between neutral and selective mutations in cancer.

Artificial life·2001
Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026
Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026
Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026
Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026
Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026
Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026
See all related articles

DNA computing, initiated in 1994, shows potential for universal computation. While theoretical advances address algorithms and error rates, practical biological demonstrations are lacking, necessitating further research into DNA manipulation and realistic problem-solving.

Area of Science:

  • Biocomputing
  • Molecular Computing
  • Computational Biology

Background:

  • The field of DNA computing was established in 1994 by L. M. Adleman's demonstration of solving the Hamiltonian path problem using DNA strands.
  • Key open questions identified include DNA's capability for universal computation, the types of algorithms it can implement, and the control of error rates in DNA manipulations.

Purpose of the Study:

  • To review theoretical advancements in DNA computing since its inception.
  • To assess the current state and future potential of DNA-based computation.
  • To highlight the gap between theoretical possibilities and practical biological implementations.

Main Methods:

  • Theoretical analysis of DNA's computational capabilities.
  • Review of proposed algorithms for DNA computation, including those for complex problems like data encryption.

Related Experiment Videos

  • Examination of theoretical approaches to mitigate error rates in DNA manipulation processes.

    • Main Results:

    • Theoretical work indicates DNA is capable of universal computation.
    • Algorithms for significant problems, such as breaking the Data Encryption Standard, have been described using existing technologies.
    • Several algorithms have been proposed to address error rates in DNA manipulation, though challenges remain.

    Conclusions:

    • DNA computing is unlikely to be a mere curiosity due to theoretical progress.
    • Significant challenges persist in error containment and correction for practical, general-purpose DNA computation.
    • Further progress requires experimental validation of theoretical results, assessment of DNA manipulation practicality, and implementation of algorithms for realistic problems.