Scarless Recombineering of Phage in Lysogenic State.

We present a scarless recombineering-based method for introducing multiple point mutations into the genome of a temperate phage. The method uses the λ Red recombineering system to promote exogenous ssDNA oligos to anneal on the prophage lagging strand during host genome replication. DNA repair is suppressed by inducing the expression of a dominant-negative mutant protein of the methyl-directed mismatch repair system. Screening for recombinant cells without a selection marker is feasible due to its high recombination frequency, estimated as more than 40% after six cycles. The method enables scarless editing of the genome of a bacteriophage in 4-5 days.

Lambda Red Recombineering of Bacteriophage in the Lysogenic State.

We present a recombineering-based method for editing the genome of a temperate phage. The method uses the lambda Red recombination system to edit the genome of a lysogenized host with a prophage compatible with bacteriophage lambda. Linear DNA is used as the recombination substrate and antibiotic resistance is used as the basis for selection of recombinants. The method enables the genetic manipulation of a prophage in 3-5 days.

Engineering Bacteria to Produce Pure Phage-like Particles for Gene Delivery.

Natural and engineered phages have been used in many applications, but their use to deliver user-defined genetic cargoes has been hampered by contamination with replicative phage, restricting use of the technology beyond the laboratory. Here we present a method to produce transducing particles without contamination. In addition, we demonstrate the use of a helper phage-free transducing particle preparation as an antimicrobial agent. This will pave the way for the development of new phage-based technologies with greater scope than lytic phage therapy.

GeneORator: An Effective Strategy for Navigating Protein Sequence Space More Efficiently through Boolean OR-Type DNA Libraries.

Directed evolution requires the creation of genetic diversity and subsequent screening or selection for improved variants. For DNA mutagenesis, conventional site-directed methods implicitly utilize the Boolean AND operator (creating all mutations simultaneously), producing a combinatorial explosion in the number of genetic variants as the number of mutations increases. We introduce GeneORator, a novel strategy for creating DNA libraries based on the Boolean logical OR operator. Here, a single library is divided into many subsets, each containing different combinations of the desired mutations. Consequently, the effect of adding more mutations on the number of genetic combinations is additive (Boolean OR logic) and not exponential (AND logic). We demonstrate this strategy with large-scale mutagenesis studies, using monoamine oxidase-N ( Aspergillus niger) as the exemplar target. First, we mutated every residue in the secondary structure-containing regions (276 out of a total 495 amino acids) to screen for improvements in kcat. Second, combinatorial OR-type libraries permitted screening of diverse mutation combinations in the enzyme active site to detect activity toward novel substrates. In both examples, OR-type libraries effectively reduced the number of variants searched up to 1010-fold, dramatically reducing the screening effort required to discover variants with improved and/or novel activity. Importantly, this approach enables the screening of a greater diversity of mutation combinations, accessing a larger area of a protein's sequence space. OR-type libraries can be applied to any biological engineering objective requiring DNA mutagenesis, and the approach has wide ranging applications in, for example, enzyme engineering, antibody engineering, and synthetic biology.

Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA.

The theory of computer science is based around universal Turing machines (UTMs): abstract machines able to execute all possible algorithms. Modern digital computers are physical embodiments of classical UTMs. For the most important class of problem in computer science, non-deterministic polynomial complete problems, non-deterministic UTMs (NUTMs) are theoretically exponentially faster than both classical UTMs and quantum mechanical UTMs (QUTMs). However, no attempt has previously been made to build an NUTM, and their construction has been regarded as impossible. Here, we demonstrate the first physical design of an NUTM. This design is based on Thue string rewriting systems, and thereby avoids the limitations of most previous DNA computing schemes: all the computation is local (simple edits to strings) so there is no need for communication, and there is no need to order operations. The design exploits DNA's ability to replicate to execute an exponential number of computational paths in P time. Each Thue rewriting step is embodied in a DNA edit implemented using a novel combination of polymerase chain reactions and site-directed mutagenesis. We demonstrate that the design works using both computational modelling and in vitro molecular biology experimentation: the design is thermodynamically favourable, microprogramming can be used to encode arbitrary Thue rules, all classes of Thue rule can be implemented, and non-deterministic rule implementation. In an NUTM, the resource limitation is space, which contrasts with classical UTMs and QUTMs where it is time. This fundamental difference enables an NUTM to trade space for time, which is significant for both theoretical computer science and physics. It is also of practical importance, for to quote Richard Feynman 'there's plenty of room at the bottom'. This means that a desktop DNA NUTM could potentially utilize more processors than all the electronic computers in the world combined, and thereby outperform the world's current fastest supercomputer, while consuming a tiny fraction of its energy.