Name
Abstract | ||
|---|---|---|
This paper proposes new models for DNA computation based on a simple principle calledequality checking. The advantages of the proposed models may include (i) the universal computabilityof the general models, (ii) the clarity and simplicity of molecular biological operationsemployed, and therefore (iii) the high feasibility in molecular biological implementationof the models.1 IntroductionSince Adleman's ground-breaking work on the DNA implementation of computing a small instanceof... |
Year | Venue | Field |
|---|---|---|
1997 | DNA Based Computers | Abstraction model checking,Theoretical computer science,DNA,Mathematics,DNA computing |
DocType | Citations | PageRank |
Conference | 4 | 0.53 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takashi Yokomori | 1 | 777 | 93.85 |
| Satoshi Kobayashi | 2 | 137 | 15.51 |