On the power of DNA-computing

DOI10.1006/INCO.1996.0094zbMATH Open1077.68647OpenAlexW2037375334MaRDI QIDQ675064FDOQ675064

Authors: Diana Rooß, K. W. Wagner 

Publication date: 16 October 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c629ac7e6fd14f8ee173bd6e2c305330183630f6

Recommendations

• scientific article; zbMATH DE number 1156876
• DNA models and algorithms for NP-complete problems
• On the computational power of DNA

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (8)

• A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE
• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• How ciliates manipulate their own DNA -- A splendid example of natural computing
• Title not available (Why is that?)
• DNA computing by blocking
• Solving traveling salesman problem in the Adleman-Lipton model
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On the power of DNA-computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675064)