Name
Abstract | ||
|---|---|---|
DNA computing, or, more generally, molecular computing, is an exciting fast developing interdisciplinary area. Research in this area concerns theory, experiments, and applications of DNA computing. In this paper, we demonstrate the theoretical developments by discussing a number of selected topics. We also give an introduction to the basic structure of DNA and the basic DNA processing tools. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0304-3975(02)00134-2 | Theor. Comput. Sci. |
Keywords | Field | DocType |
basic structure,basic DNA processing tool,theoretical development,Turing universality,Splicing systems,Boolean circuits,Molecular computing,Cryptography,selected topic,Biomolecular tool box,DNA computing,interdisciplinary area,Recursively enumerable languages,molecular computing,area concerns theory,DNA molecules | Discrete mathematics,Boolean circuit,Turing universality,Cryptography,Recursively enumerable language,Theoretical computer science,Mathematics,DNA computing | Journal |
Volume | Issue | ISSN |
287 | 1 | Theoretical Computer Science |
Citations | PageRank | References |
4 | 0.62 | 24 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martyn Amos | 1 | 203 | 27.72 |
| Gheorghe Paun | 2 | 2840 | 369.48 |
| Grzegorz Rozenberg | 3 | 5208 | 1039.94 |
| Arto Salomaa | 4 | 2732 | 634.55 |