scientific article; zbMATH DE number 1738639
From MaRDI portal
Publication:4529973
zbMATH Open0984.68660MaRDI QIDQ4529973FDOQ4529973
Authors: Ravinderjit S. Braich, Cliff Johnson, Paul Wilhelm Karl Rothemund, Darryl Hwang, Nickolas V. Chelyapov 
Publication date: 7 May 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2054/20540027
Title of this publication is not available (Why is that?)
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
- scientific article; zbMATH DE number 1738649
- scientific article; zbMATH DE number 2087018
- Solution of a problem in DNA computing.
- On DNA-based gellular automata
- scientific article; zbMATH DE number 1335890
Computing methodologies and applications (68U99) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (25)
- Deterministic polynomial-time algorithms for designing short DNA words
- Title not available (Why is that?)
- Title not available (Why is that?)
- The emerging discipline of biomolecular computation in the US
- Title not available (Why is that?)
- Performing DNA computation with RecA-mediated triple-stranded DNA structure
- Arithmetic computation in the tile assembly model: addition and multiplication
- Solving NP-complete problems in the tile assembly model
- Title not available (Why is that?)
- Automated design and programming of a microfluidic DNA computer
- Strand design for biomolecular computation.
- Solving the minimum bisection problem using a biologically inspired computational model
- Title not available (Why is that?)
- Computing by polymerase chain reaction
- Modeling Non-specific Binding in Gel-Based DNA Computers
- Solving the maximal matching problem with DNA molecules in Adleman-Lipton model
- Solving the maximum weighted clique problem based on parallel biological computing model
- DNA Recombination by XPCR
- A DNA-based graph encoding scheme with its applications to graph isomorphism problems
- A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
- Title not available (Why is that?)
- Measurement of the number of molecules of a single mRNA species in a complex mRNA preparation
- Automating the DNA Computer: Solving n-Variable 3-SAT Problems
- Nondeterministic polynomial time factoring in the tile assembly model
- Automating the DNA computer: Solving \(n\)-variable 3-SAT problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529973)
