Sciweavers

DNA
2001
Springer
164views Bioinformatics» more  DNA 2001»
13 years 10 months ago
A Clause String DNA Algorithm for SAT
A DNA algorithm for SAT, the satisfiability of propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This re...
Vincenzo Manca, Claudio Zandron
DNA
2001
Springer
139views Bioinformatics» more  DNA 2001»
13 years 10 months ago
DNA Computing in Microreactors
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
Danny van Noort, Frank-Ulrich Gast, John S. McCask...
DNA
2001
Springer
125views Bioinformatics» more  DNA 2001»
13 years 10 months ago
PNA-mediated Whiplash PCR
The directed evolution of proteins, using an in vitro domainal shuffling strategy was proposed in (J. Kolkman and W. Stemmer, Nat. Biotech. 19, 423 (2001). Due to backhybridization...
John A. Rose, Russell J. Deaton, Masami Hagiya, Ak...
DNA
2001
Springer
100views Bioinformatics» more  DNA 2001»
13 years 10 months ago
Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability
John H. Reif, Thomas H. LaBean, Michael Pirrung, V...
DNA
2001
Springer
13 years 10 months ago
The Fidelity of the Tag-Antitag System
In the universal DNA chip method, target RNAs are mapped onto a set of DNA tags. Parallel hybridization of these tags with an indexed, complementary antitag array then provides an ...
John A. Rose, Russell J. Deaton, Masami Hagiya, Ak...
Bioinformatics
Top of PageReset Settings