Demonstration of a word design strategy for DNA computing on surfaces

A surface invasive cleavage assay for highly parallel SNP analysis

The structure-specific invasive cleavage of single-stranded DNA by 5' nucleases is a useful means for sensitive detection of single-nucleotide polymorphisms or SNPs. The solution-phase invasive cleavage reaction has sufficient sensitivity for direct detection of as few as 600 target molecules with no prior target amplification. One approach to the parallelization of SNP analysis is to adapt the invasive cleavage reaction to an addressed array format. Two surface invasive cleavage reaction strategies were designed and tested using the polymorphic site in codon 158 of the human ApoE gene as a model system, with a synthetic oligonucleotide as target. The upstream oligonucleotide, which is required for the invasive cleavage reaction, was either added in solution (strategy 1), or co-immobilized on the surface along with the probe oligonucleotide (strategy 2). Both strategies showed target-concentration and time-dependent amplification of signal. Parameters that govern the rate of the surface-invasive cleavage reactions are discussed.

SPR imaging measurements of 1-D and 2-D DNA microarrays created from microfluidic channels on gold thin films

Microfluidic channels fabricated from poly(dimethylsiloxane) (PDMS) are employed in surface plasmon resonance imaging experiments for the detection of DNA and RNA adsorption onto chemically modified gold surfaces. The PDMS microchannels are used to (i) fabricate "1-D" single-stranded DNA (ssDNA) line arrays that are used in SPR imaging experiments of oligonucleotide hybridization adsorption and (ii) create "2-D" DNA hybridization arrays in which a second set of PDMS microchannels are placed perpendicular to a 1-D line array in order to deliver target oligonucleotide solutions. In the 1-D line array experiments, the total sample volume is 500 microL; in the 2-D DNA array experiments, this volume is reduced to 1 microL. As a demonstration of the utility of these microfluidic arrays, a 2-D DNA array is used to detect a 20-fmol sample of in vitro transcribed RNA from the uidA gene of a transgenic Arabidopsis thaliana plant. It is also shown that this array fabrication method can be used for fluorescence measurements on chemically modified gold surfaces.

On combinatorial DNA word design

We consider the problem of designing DNA codes, namely sets of equi-length words over the alphabet [A, C, G, T] that satisfy certain combinatorial constraints. This problem is motivated by the task of reliably storing and retrieving information in synthetic DNA strands for use in DNA computing or as molecular bar codes in chemical libraries. The primary constraints that we consider, defined with respect to a parameter d, are as follows: for every pair of words w, x in a code, there are at least d mismatches between w and x if w not equal x and also between the reverse of w and the Watson-Crick complement of x. Extending classical results from coding theory, we present several upper and lower bounds on the maximum size of such DNA codes and give methods for constructing such codes. An additional constraint that is relevant to the design of DNA codes is that the free energies and enthalpies of the code words, and thus the melting temperatures, be similar. We describe dynamic programming algorithms that can (a) calculate the total number of words of length n whose free energy value, as approximated by a formula of Breslauer et al. (1986) falls in a given range, and (b) output a random such word. These algorithms are intended for use in heuristic algorithms for constructing DNA codes.

A DNA computing readout operation based on structure-specific cleavage

We describe a structure-specific cleavage-based READOUT strategy for surface-based DNA computing. The strategy was demonstrated in the solution of a 4-variable/3-satisfiability (SAT) problem. The READOUT step identifies the DNA molecules present at the end of the computational process. The specificity of the sequence detection used here derives from the sequence specificity of DNA hybridization coupled with the structure specificity of the enzymatic cleavage. The process is linear, yielding a higher uniformity of detection of the DNA computing products compared to that obtained with PCR amplification. The structure-specific cleavage-based readout is simple, accurate, and compatible with multiple-word DNA computing.

Universal DNA tag systems: a combinatorial design scheme

Custom-designed DNA arrays offer the possibility of simultaneously monitoring thousands of hybridization reactions. These arrays show great potential for many medical and scientific applications, such as polymorphism analysis and genotyping. Relatively high costs are associated with the need to specifically design and synthesize problem-specific arrays. Recently, an alternative approach was suggested that utilizes fixed, universal arrays. This approach presents an interesting design problem-the arrays should contain as many probes as possible, while minimizing experimental errors caused by cross-hybridization. We use a simple thermodynamic model to cast this design problem in a formal mathematical framework. Employing new combinatorial ideas, we derive an efficient construction for the design problem and prove that our construction is near-optimal.

Surface plasmon resonance imaging measurements of ultrathin organic films

The surface-sensitive optical technique of surface plasmon resonance (SPR) imaging is used to characterize ultrathin organic and biopolymer films at metal interfaces in a spatially resolved manner. Because of its high surface sensitivity and its ability to measure in real time the interaction of unlabeled biological molecules with arrays of surface-bound species, SPR imaging has the potential to become a powerful tool in biomolecular investigations. Recently, SPR imaging has been successfully implemented in the characterization of supported lipid bilayer films, the monitoring of antibody-antigen interactions at surfaces, and the study of DNA hybridization adsorption. The following is included in this review: (a) an introduction to the principles of surface plasmon resonance, (b) the details of SPR imaging instrumental design, (c) a short discussion concerning resolution, sensitivity, and quantitation in SPR imaging, (d) the details of DNA array fabrication on chemically modified gold surfaces, and (e) two examples that demonstrate the application of the SPR imaging technique to the study of protein-DNA interactions.

Optically programming DNA computing in microflow reactors

The programmability and the integration of biochemical processing protocols are addressed for DNA computing using photochemical and microsystem techniques. A magnetically switchable selective transfer module (STM) is presented which implements the basic sequence-specific DNA filtering operation under constant flow. Secondly, a single steady flow system of STMs is presented which solves an arbitrary instance of the maximal clique problem of given maximum size N. Values of N up to about 100 should be achievable with current lithographic techniques. The specific problem is encoded in an initial labeling pattern of each module with one of 2N DNA oligonucleotides, identical for all instances of maximal clique. Thirdly, a method for optically programming the DNA labeling process via photochemical lithography is proposed, allowing different problem instances to be specified. No hydrodynamic switching of flows is required during operation -- the STMs are synchronously clocked by an external magnet. An experimental implementation of this architecture is under construction and will be reported elsewhere.

An improved surface-based method for DNA computation

DNA computing is a novel method for solving a class of intractable computational problems, in which the computing time can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability, among which a surface-based method is an efficient candidate. In this paper, the surface-based approach proposed by Liu, Q., Wang, L., Frutos, A.G., Condon, A.E., Corn, R.M., and Smith, L.M., 2000, DNA computing on surfaces. Nature 403, 175-179 is analyzed and an improved surface-based method for DNA computation (i.e. the hybrid DNA/optical computing method) is proposed. Compared with Liu et al.'s approach, our method has some significant advantages such as low cost, short operating time, reusable surface and simple experimental steps. Moreover, the concept of combining easily patterned DNA computing steps with equally parallel, but generally uniform and not easily patterned optical computing steps is an important new direction.

Covalent attachment of oligodeoxyribonucleotides to amine-modified Si (001) surfaces

A recently described reaction for the UV-mediated attachment of alkenes to silicon surfaces is utilized as the basis for the preparation of functionalized silicon surfaces. UV light mediates the reaction of t-butyloxycarbonyl (t-BOC) protected omega-unsaturated aminoalkane (10-aminodec-1-ene) with hydrogen-terminated silicon (001). Removal of the t-BOC protecting group yields an aminodecane-modified silicon surface. The resultant amino groups can be coupled to thiol-modified oligodeoxyribonucleotides using a heterobifunctional crosslinker, permitting the preparation of DNA arrays. Two methods for controlling the surface density of oligodeoxyribonucleotides were explored: in the first, binary mixtures of 10-aminodec-1-ene and dodecene were utilized in the initial UV-mediated coupling reaction; a linear relationship was found between the mole fraction of aminodecene and the density of DNA hybridization sites. In the second, only a portion of the t-BOC protecting groups was removed from the surface by limiting the time allowed for the deprotection reaction. The oligodeoxyribonucleotide-modified surfaces were extremely stable and performed well in DNA hybridization assays. These surfaces provide an alternative to gold or glass for surface immobilization of oligonucleotides in DNA arrays as well as a route for the coupling of nucleic acid biomolecular recognition elements to semiconductor materials.

Molecular computation by DNA hairpin formation

Hairpin formation by single-stranded DNA molecules was exploited in a DNA-based computation in order to explore the feasibility of autonomous molecular computing. An instance of the satisfiability problem, a famous hard combinatorial problem, was solved by using molecular biology techniques. The satisfiability of a given Boolean formula was examined autonomously, on the basis of hairpin formation by the molecules that represent the formula. This computation algorithm can test several clauses in the given formula simultaneously, which could reduce the number of laboratory steps required for computation.

Molecular computation: RNA solutions to chess problems

We have expanded the field of "DNA computers" to RNA and present a general approach for the solution of satisfiability problems. As an example, we consider a variant of the "Knight problem," which asks generally what configurations of knights can one place on an n x n chess board such that no knight is attacking any other knight on the board. Using specific ribonuclease digestion to manipulate strands of a 10-bit binary RNA library, we developed a molecular algorithm and applied it to a 3 x 3 chessboard as a 9-bit instance of this problem. Here, the nine spaces on the board correspond to nine "bits" or placeholders in a combinatorial RNA library. We recovered a set of "winning" molecules that describe solutions to this problem.

DNA computing on surfaces

DNA computing was proposed as a means of solving a class of intractable computational problems in which the computing time can grow exponentially with problem size (the 'NP-complete' or non-deterministic polynomial time complete problems). The principle of the technique has been demonstrated experimentally for a simple example of the hamiltonian path problem (in this case, finding an airline flight path between several cities, such that each city is visited only once). DNA computational approaches to the solution of other problems have also been investigated. One technique involves the immobilization and manipulation of combinatorial mixtures of DNA on a support. A set of DNA molecules encoding all candidate solutions to the computational problem of interest is synthesized and attached to the surface. Successive cycles of hybridization operations and exonuclease digestion are used to identify and eliminate those members of the set that are not solutions. Upon completion of all the multistep cycles, the solution to the computational problem is identified using a polymerase chain reaction to amplify the remaining molecules, which are then hybridized to an addressed array. The advantages of this approach are its scalability and potential to be automated (the use of solid-phase formats simplifies the complex repetitive chemical processes, as has been demonstrated in DNA and protein synthesis). Here we report the use of this method to solve a NP-complete problem. We consider a small example of the satisfiability problem (SAT), in which the values of a set of boolean variables satisfying certain logical constraints are determined.

Progress toward demonstration of a surface based DNA computation: a one word approach to solve a model satisfiability problem

A multi-base encoding strategy is used in a one word approach to surface-based DNA computation. In this designed DNA model system, a set of 16 oligonucleotides, each a 16mer, is used with the format 5'-FFFFvvvvvvvvFFFF-3' in which 4-8 bits of data are stored in eight central variable ('v') base locations, and the remaining fixed ('F') base locations are used as a word label. The detailed implementations are reported here. In order to achieve perfect discrimination between each oligonucleotide, the efficiency and specificity of hybridization discrimination of the set of 16 oligonucleotides were examined by carrying out the hybridization of each individual fluorescently tagged complement to an array of 16 addressed immobilized oligonucleotides. A series of preliminary hybridization experiments are presented and further studies about hybridization, enzymatic destruction, read out and demonstrations of a SAT problem are forthcoming.

Surface-based DNA computing operations: DESTROY and READOUT

DNA computing on surfaces is where complex combinatorial mixtures of DNA molecules are immobilized on a substrate and subsets are tagged and enzymatically modified (DESTROY) in repeated cycles of the DNA computation. A restriction enzyme has been chosen for the surface DESTROY operation. For the READOUT operation, both cycle sequencing and PCR amplification followed by addressed array hybridization were studied to determine the DNA sequences after the computations.

The complexities of DNA computation

Over the past few years, a handful of insightful researchers have bridged the gap between biological computing theory and actual DNA-based computation. By using ingenious encoding techniques and clever molecular-biological manipulations, simple versions of computationally complex problems have been experimentally approached or resolved. However, the technical problems revealed during the execution of these scientific set pieces make it unlikely that DNA will ever rival silicon for the solution of any real-world problem.

A sticker-based model for DNA computation

We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which information is represented and of separation by hybridization as a central mechanism. However, unlike previous models, the stickers model has a random access memory that requires no strand extension and uses no enzymes; also (at least in theory), its materials are reusable. The paper describes computation under the stickers model and discusses possible means for physically implementing each operation. Finally, we go on to propose a specific machine architecture for implementing the stickers model as a microprocessor-controlled parallel robotic workstation. In the course of this development a number of previous general concerns about molecular computation (Smith, 1996; Hartmanis, 1995; Linial et al., 1995) are addressed. First, it is clear that general-purpose algorithms can be implemented by DNA-based computers, potentially solving a wide class of search problems. Second, we find that there are challenging problems, for which only modest volumes of DNA should suffice. Third, we demonstrate that the formation and breaking of covalent bonds is not intrinsic to DNA-based computation. Fourth, we show that a single essential biotechnology, sequence-specific separation, suffices for constructing a general-purpose molecular computer. Concerns about errors in this separation operation and means to reduce them are addressed elsewhere (Karp et al., 1995; Roweis and Winfree, 1999). Despite these encouraging theoretical advances, we emphasize that substantial engineering challenges remain at almost all stages and that the ultimate success or failure of DNA computing will certainly depend on whether these challenges can be met in laboratory investigations.

The fidelity of template-directed oligonucleotide ligation and its relevance to DNA computation

Several different computational problems have been solved using DNA as a medium. However, the DNA computations that have so far been carried out have examined a relatively small number of possible sequence solutions in order to find correct sequence solutions. We have encoded a search algorithm in DNA that required the evaluation of >16 000 000 possible sequence solutions in order to find a single, correct sequence solution. Experimental evaluation of the search algorithm revealed bounds for the accuracies of answers to other large, computationally complex problems and suggested methods for the optimization of DNA computations in general. Short oligonucleotide substrates performed substantially better than longer substrates. Large, computationally complex problems whose evaluation requires hybridization and ligation can likely best be encoded and evaluated using short oligonucleotides at mesophilic temperatures.

A surface-based approach to DNA computation

A scalable approach to DNA-based computations is described. Complex combinatorial mixtures of DNA molecules encoding all possible answers to a computational problem are synthesized and attached to the surface of a solid support. This set of molecules is queried in successive MARK (hybridization) and DESTROY (enzymatic digestion) operations. Determination of the sequence of the DNA molecules remaining on the surface after completion of these operations yields the answer to the computational problem. Experimental demonstrations of aspects of the strategy are presented.