Theoretical and Experimental DNA Computation (Natural ...
Theoretical and Experimental DNA Computation (Natural ...
Theoretical and Experimental DNA Computation (Natural ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
5.11 Bibliographical Notes 145<br />
which direct the assembly of the macrostructure. The tiles then self-assemble<br />
to perform a computation. The authors of [103] report successful XOR computations<br />
on pairs of bits, but note that the scalability of the approach relies on<br />
proper hairpin formation in very long single-str<strong>and</strong>ed molecules, which cannot<br />
be assumed.<br />
We now briefly describe some “late-breaking” results. The construction of<br />
molecular automata (see Chap. 3) was demonstrated by Benenson et al. in [27].<br />
This experiment builds on the authors’ earlier work [28] on the construction<br />
of biomolecular machines. In [27], the authors describe the construction of a<br />
molecular automaton that uses the process of <strong>DNA</strong> backbone hydrolysis <strong>and</strong><br />
str<strong>and</strong> hybridization, fuelled by the potential free energy stored in the <strong>DNA</strong><br />
itself.<br />
Related work, due to Stojanovic <strong>and</strong> Stefanovic [147], describes a molecular<br />
automaton that plays the game of tic-tac-toe (or noughts <strong>and</strong> crosses)<br />
against a human opponent. The automaton is a Boolean network of deoxribozymes<br />
incorporating 23 molecular-scale logic gates <strong>and</strong> one constitutively<br />
active deozyribozyme arrayed in a 3×3 well formation (to represent the game<br />
board). The human player signals a move by adding an input oligo, <strong>and</strong> the<br />
automaton’s move is signalled by fluorescence in a particular well. This cycle<br />
continues until there is either a draw or a victory for the automaton, as it<br />
plays a perfect strategy <strong>and</strong> cannot be defeated.<br />
5.10 Summary<br />
In this chapter we have described in depth the experimental realization of<br />
some of the abstract models of <strong>DNA</strong> computation described in Chap. 2. We<br />
described Adleman’s seminal experiment, as well as a potential implementation<br />
of the parallel filtering model, which laid the foundations for important<br />
later work on destructive algorithms. We also described some key contributions<br />
to the laboratory implementation of computations, <strong>and</strong> highlighted some<br />
late-breaking results.<br />
5.11 Bibliographical Notes<br />
The use of molecules other than <strong>DNA</strong> (for example, proteins <strong>and</strong> chemical<br />
systems) is reviewed <strong>and</strong> discussed in [144]. Chen <strong>and</strong> Wood [44] review early<br />
work on implementations of biomolecular computatons, <strong>and</strong> suggest potentially<br />
useful lines of enquiry. The recent proceedings of the International Workshop<br />
on <strong>DNA</strong> Based Computers [43, 73] contain many articles on laboratory<br />
implementations, including notable papers on whiplash PCR [105] <strong>and</strong> <strong>DNA</strong>based<br />
memory [42].