| Abstract |
|
|
|
|
|
|
|
|
|
|
| In this
presentation, the DNA computing (DNAC) |
|||||||||
| will be
introduced. After a brief reviewing of its |
|||||||||
| history,
we first describe the DNA structure and |
|||||||||
| the
typical methodology for DNAC is |
|||||||||
| presented.
To show the efficacy of the DNAC, |
|||||||||
| we
describe a DNAC-based algorithm to solve |
|||||||||
| the
Hamilton path problem. We then |
|||||||||
| summarize
the pros and cons of the DNAC |
|||||||||
| compared with
other methods. |
|||||||||