DATE: | Wednesday, October 21st, 1998 |
TIME: | 16:00-17:00 |
PLACE: | McConnell 320 |
TITLE: | DNA computing in vitro and in vivo. |
SPEAKER: | Lila Kari, University of Western Ontario |
This talk addresses the issues of the computational power of DNA computing in vitro and in vivo.
Firstly, I present a mathematical model of DNA computing based on insertions and deletions, which turns out to have universal computational power. As insertions and deletions are implementable by using site-specific mutagenesis, this opens one possible way of designing ``test-tube'' programmable DNA computers.
Secondly, I show that guided homologous recombinations that take place during gene rearrangement in ciliated protozoans have the computational power of a Turing machine. This indicates that in principle a unicellular organism has the capacity to perform at least any computation carried out by an electronic computer.
Besides the novelty of the approach, biomolecular computing has the potential to outperform electronic computers. For example, DNA computations may use a billion times less energy than an electronic computer, while storing data in a trillion times less space. Moreover, computing with DNA is highly parallel: in principle there could be billions or trillions of DNA molecules undergoing chemical reactions, that is, performing computations, simultaneously.