13.12.2012 Views

Theoretical and Experimental DNA Computation (Natural ...

Theoretical and Experimental DNA Computation (Natural ...

Theoretical and Experimental DNA Computation (Natural ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

134 5 Physical Implementations<br />

We also carried out extensive control experiments to ensure the specificity<br />

of the PCR detection step (i.e., to ensure that str<strong>and</strong>s were not removed<br />

without this being done explicitly). Also, control experiments indicated the<br />

inefficiency of the Sau3A restriction enzyme that was originally used, though<br />

an isoschizomer, MboI, worked well.<br />

Ensure that the initial library is constructed cleanly before<br />

proceeding<br />

A fundamental prerequisite for correct algorithmic implementation is that<br />

the initial library of str<strong>and</strong>s be constructed as expected. This is especially<br />

important for algorithms within filtering models, since we must be absolutely<br />

sure that every possible solution to the given problem is represented as a<br />

str<strong>and</strong>. While describing their attempt to recreate Adleman’s experiment,<br />

Kaplan et al. [86] acknowledge the difficulty of obtaining clean generation of<br />

the initial library.<br />

There are several potential problems inherent to the construction of an<br />

initial library by the annealing <strong>and</strong> ligation of many small str<strong>and</strong>s. Incomplete<br />

or irregular ligation can result in shorter than expected str<strong>and</strong>s. We checked<br />

for this, <strong>and</strong> observed that the majority of the product was of the expected<br />

length. In addition to checking the length of the product, we rigorously ensured<br />

that there is sufficient variability within the initial library by cloning a sample<br />

into E.coli <strong>and</strong> sequencing their <strong>DNA</strong>.<br />

Correct str<strong>and</strong>/primer design is vital<br />

In [3] Adleman originally suggested using r<strong>and</strong>om sequences to represent vertices<br />

within the given graph. He explained this choice by stating that it was<br />

unlikely that sequences chosen to represent different vertices would share long<br />

common subsequences, <strong>and</strong> that undesirable features such as hairpin loops<br />

would be unlikely to occur. The selection of r<strong>and</strong>om sequences was also supported<br />

by Lipton in [98].<br />

Since the publication of [3] <strong>and</strong> [98], the use of r<strong>and</strong>om sequences has been<br />

called into question [23, 51, 52, 108]. It is clear that for any nontrivial problem,<br />

careful thought must go into the design of sequences to represent potential<br />

solutions if we are to avoid the problems described above.<br />

One major problem we encountered was due to the sequences chosen to<br />

represent target sequences. We made a completely arbitrary decision to differentiate<br />

S1 by the sequence AAAAAA, S2 by CCCCCC,<strong>and</strong>S3 by GGGGGG.<br />

In retrospect, it is clear that this was a bad choice for two main reasons. The<br />

first concerns the S2 <strong>and</strong> S3 primers. It is clear that, in solution, these primers<br />

are complementary, <strong>and</strong> are just as likely to anneal to one another as they<br />

are to the target sequences. Obviously, this will greatly reduce the efficiency<br />

of the removal operation. The second problem concerns the melting temperatures<br />

of the primers. Because the melting temperatures of the S1 primers was

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!