Autonomous resolution based on DNA strand displacement
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1241368
- Automated design and programming of a microfluidic DNA computer
- Automating the DNA computer: Solving \(n\)-variable 3-SAT problems
- Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
- scientific article; zbMATH DE number 2087017
Cites work
- A Computing Procedure for Quantification Theory
- Horn clause computation with DNA molecules
- scientific article; zbMATH DE number 1735643 (Why is no real title available?)
- scientific article; zbMATH DE number 2087017 (Why is no real title available?)
- scientific article; zbMATH DE number 2087030 (Why is no real title available?)
- Scalable, time-responsive, digital, energy-efficient molecular circuits using DNA strand displacement
- Space bounds for resolution
- Strand Algebras for DNA Computing
- THE INFERENCE BASED ON MOLECULAR COMPUTING
- The intractability of resolution
Cited in
(7)- Automated, constraint-based analysis of tethered DNA nanostructures
- Autonomous forward inference via DNA computing
- Probabilistic reasoning with a Bayesian DNA device based on strand displacement
- Logical inference by DNA strand algebra
- scientific article; zbMATH DE number 2087030 (Why is no real title available?)
- Probabilistic reasoning with an enzyme-driven DNA device
- Probabilistic reasoning with a Bayesian DNA device based on strand displacement
This page was built for publication: Autonomous resolution based on DNA strand displacement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092341)