Abstract
Four specific complexity measures for DNA-based computations are considered: the number of test tubes, the maximal number of molecules in a tube, the maximal length of a molecule, the number of elementary lab operations. These measures are estimated for three DNA procedures for computing the integer addition table. Then, using the addition table, two algorithms for the Boolean convolution are considered and evaluated from the point of view of their complexity.
| Original language | English |
|---|---|
| Pages (from-to) | 319 |
| Number of pages | 329 |
| Journal | Romanian Journal of Information Science and Technology |
| Volume | 1 |
| Issue number | 4 |
| Publication status | Published - 1998 |
Subject classification (UKÄ)
- Computer and Information Science