The fact that one of the most fundamental building blocks of life, deoxyribonucleic acid, DNA for short, can be used to compute solutions to combinatorial problems has been demonstrated by Adleman in 1994. Using double stranded DNA he solved an 7 node instance for the Hamiltonian path problem. The field of DNA computing has evolved rapidly since 1994, algorithms for different combinatorial problems have been proposed, different models of computation with DNA have been considered and many experiments have been conducted.
In this talk we will give an introduction to DNA Computing, present Adlemans approach, give various types of applications and DNA algorithms, and show how to play Tic-Tac-Toe against a "bio computer".
Colloquia Series page.