Name
Abstract | ||
|---|---|---|
In this paper we examine the computational capabilities inherent in the hybridizationof DNA molecules. First we consider theoretical models, and show that theself-assembly of oligonucleotides into linear duplex DNA can only generate sets of sequencesequivalent to regular languages. If branched DNA is used for self-assemblyof dendrimer structures, only sets of sequences equivalent to context-free languagescan be achieved. In contrast, the self-assembly of double crossover molecules intotwo ... |
Year | Venue | Field |
|---|---|---|
1996 | DNA Based Computers | Cellular automaton,Dendrimer,Crossover,Universal class,Algorithm,DNA,Oligonucleotide,Regular language,Mathematics,Computation |
DocType | Citations | PageRank |
Conference | 107 | 16.44 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik Winfree | 1 | 1314 | 157.04 |
| Xiaoping Yang | 2 | 117 | 18.49 |
| Nadrian C Seeman | 3 | 285 | 41.94 |