Solution of a satisfiability problem on a gel-based DNA computer

DOI10.1007/3-540-44992-2_3MaRDI QIDQ4529973zbMATH OpenFDO

Authors Ravinderjit S. Braich, Cliff Johnson, Paul Wilhelm Karl Rothemund, Darryl Hwang, Nickolas V. Chelyapov

Publication date 7 May 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2054/20540027

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2089972
• Automating the DNA Computer: Solving n-Variable 3-SAT Problems
• Automating the DNA computer: Solving \(n\)-variable 3-SAT problems
• Solving computational learning problems of Boolean formulae on DNA computers
• scientific article; zbMATH DE number 2087018
• Solution of a problem in DNA computing.
• On DNA-based gellular automata
• scientific article; zbMATH DE number 1335890

Cited in

(26)

• Solving the maximum weighted clique problem based on parallel biological computing model
• Strand design for biomolecular computation.
• Measurement of the number of molecules of a single mRNA species in a complex mRNA preparation
• A DNA-based graph encoding scheme with its applications to graph isomorphism problems
• Computing by polymerase chain reaction
• A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
• Solving the maximal matching problem with DNA molecules in Adleman-Lipton model
• DNA Recombination by XPCR
• Deterministic polynomial-time algorithms for designing short DNA words
• scientific article; zbMATH DE number 1342106 (Why is no real title available?)
• scientific article; zbMATH DE number 1953213 (Why is no real title available?)
• Solving computational learning problems of Boolean formulae on DNA computers
• 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 1568795 (Why is no real title available?)
• Automating the DNA Computer: Solving n-Variable 3-SAT Problems
• Modeling Non-specific Binding in Gel-Based DNA Computers
• On the computational power of DNA
• The emerging discipline of biomolecular computation in the US
• Performing DNA computation with RecA-mediated triple-stranded DNA structure
• Solving the minimum bisection problem using a biologically inspired computational model
• Automated design and programming of a microfluidic DNA computer
• Arithmetic computation in the tile assembly model: addition and multiplication
• Nondeterministic polynomial time factoring in the tile assembly model
• Solving NP-complete problems in the tile assembly model
• Automating the DNA computer: Solving \(n\)-variable 3-SAT problems

This page was built for publication: Solution of a satisfiability problem on a gel-based DNA computer

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