109
Voted
DNA
15 years 6 months ago
2001 Springer 
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...
117
Voted
DNA
15 years 6 months ago
2001 Springer 
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 ...
83
Voted
DNA
15 years 6 months ago
2001 Springer
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...
98
Voted
DNA
15 years 6 months ago
2001 Springer 100
Voted
DNA
15 years 6 months ago
2001 Springer
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 ...
|
Bioinformatics