On the computational power of DNA
From MaRDI portal
Recommendations
Cites work
- Algorithms for maximum independent sets
- DNA models and algorithms for NP-complete problems
- Finding a Maximum Independent Set
- scientific article; zbMATH DE number 1241370 (Why is no real title available?)
- scientific article; zbMATH DE number 1241372 (Why is no real title available?)
- scientific article; zbMATH DE number 871944 (Why is no real title available?)
- On Approximation Algorithms for # P
- On the computational power of DNA
- Random generation of combinatorial structures from a uniform distribution
Cited in
(46)- DNA models and algorithms for NP-complete problems
- Horn clause computation with DNA molecules
- DNA computing: Arrival of biological mathematics
- Is DNA computing viable for 3-SAT problems?
- Using DNA to solve the bounded Post correspondence problem
- Cyclic DNA codes over the ring \(\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2+v^2\mathbb {F}_2+uv^2\mathbb {F}_2\)
- Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\)
- Secure hash algorithm-2 formed on DNA
- Graph splicing systems
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- Genetic algorithm in DNA computing: a solution to the maximal clique problem
- DNA and quantum based algorithms for VLSI circuits testing
- Leader election and shape formation with self-organizing programmable matter
- Approximate reasoning on a DNA‐chip
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA
- A CONSTANT TIME ALGORITHM FOR DNA ADD
- scientific article; zbMATH DE number 1241364 (Why is no real title available?)
- scientific article; zbMATH DE number 1241368 (Why is no real title available?)
- scientific article; zbMATH DE number 1241376 (Why is no real title available?)
- scientific article; zbMATH DE number 1024500 (Why is no real title available?)
- scientific article; zbMATH DE number 1953209 (Why is no real title available?)
- scientific article; zbMATH DE number 1953213 (Why is no real title available?)
- scientific article; zbMATH DE number 1962032 (Why is no real title available?)
- scientific article; zbMATH DE number 2013490 (Why is no real title available?)
- DNA2DNA computations: A potential “killer app”?
- Molecular computing, bounded nondeterminism, and efficient recursion
- scientific article; zbMATH DE number 1369845 (Why is no real title available?)
- scientific article; zbMATH DE number 2087018 (Why is no real title available?)
- scientific article; zbMATH DE number 1568794 (Why is no real title available?)
- scientific article; zbMATH DE number 1568805 (Why is no real title available?)
- scientific article; zbMATH DE number 1836442 (Why is no real title available?)
- scientific article; zbMATH DE number 2089972 (Why is no real title available?)
- Improved Leader Election for Self-organizing Programmable Matter
- DNA computing model of the 0-1 programming problem
- Automating the DNA Computer: Solving n-Variable 3-SAT Problems
- DNA Computing
- DNA Computing
- Distributed transformations of Hamiltonian shapes based on line moves
- Distributed transformations of Hamiltonian shapes based on line moves
- Biomolecular realizations of a parallel architecture for solving combinatorial problems
- On the computational power of DNA
- On the power of DNA-computing
- The emerging discipline of biomolecular computation in the US
- Experimental efficiency of programmed mutagenesis
- Automating the DNA computer: Solving \(n\)-variable 3-SAT problems
This page was built for publication: On the computational power of DNA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961619)
