Modeling Non-specific Binding in Gel-Based DNA Computers

DOI10.1007/978-3-540-77962-9_18zbMATH Open1137.68393OpenAlexW1569803799MaRDI QIDQ5452695FDOQ5452695

Authors: Clifford R. Johnson 

Publication date: 4 April 2008

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77962-9_18

Recommendations

• Automating the DNA computer: Solving \(n\)-variable 3-SAT problems
• scientific article; zbMATH DE number 1738639
• Automating the DNA Computer: Solving n-Variable 3-SAT Problems
• Is DNA computing viable for 3-SAT problems?
• scientific article; zbMATH DE number 1241368

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Protein sequences, DNA sequences (92D20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (2)

• Automating the DNA Computer: Solving n-Variable 3-SAT Problems
• Automating the DNA computer: Solving \(n\)-variable 3-SAT problems

This page was built for publication: Modeling Non-specific Binding in Gel-Based DNA Computers

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