Parallel molecular computation
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Solving Intractable Problems with DNA Computing
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
| Hi-index | 0.00 |
Although DNA (deoxy-ribo nucleic acid) can perform 1022 computations per second, it is time intensive and complex to set up input and output of data to and from a biological computer and to filter the final result. This paper, discusses how to simulate DNA computing on a digital computer to solve the Hamiltonian path problem using Adleman's model. The simulation serves as an educational tool to teach DNA computing without the elaborate bio-experiments. As an aside, it also digitally verifies Adleman's notion of DNA computing to solve the Hamiltonian path problem. Future work will involve a parallel implementation of the algorithm and investigation of the possibility of construction of simple regular VLSI structures to implement the basics of the model for fixed-sized problems.