skip to main content

Title: GoldBricks: an improved cloning strategy that combines features of Golden Gate and BioBricks for better efficiency and usability

With increasing complexity of expression studies and the repertoire of characterized sequences, combinatorial cloning has become a common necessity. Techniques like BioBricks and Golden Gate aim to standardize and speed up the process of cloning large constructs while enabling sharing of resources. The BioBricks format provides a simplified and flexible approach to endless assembly with a compact library and useful intermediates but is a slow process, joining only two parts in a cycle. Golden Gate improves upon the speed with use of Type IIS enzymes and joins several parts in a cycle but requires a larger library of parts and logistical inefficiencies scale up significantly in the multigene format. We present here a method that provides improvement over these techniques by combining their features. By using Type IIS enzymes in a format like BioBricks, we have enabled a faster and efficient assembly with reduced scarring, which performs at a similarly fast pace as Golden Gate, but significantly reduces library size and user input. Additionally, this method enables faster assembly of operon-style constructs, a feature requiring extensive workaround in Golden Gate. Our format allows such inclusions resulting in faster and more efficient assembly.

more » « less
Award ID(s):
Author(s) / Creator(s):
Publisher / Repository:
Oxford University Press
Date Published:
Journal Name:
Synthetic Biology
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    Plant biotechnology is rife with new advances in transformation and genome engineering techniques. A common requirement for delivery and coordinated expression in plant cells, however, places the design and assembly of transformation constructs at a crucial juncture as desired reagent suites grow more complex. Modular cloning principles have simplified some aspects of vector design, yet many important components remain unavailable or poorly adapted for rapid implementation in biotechnology research. Here, we describe a universal Golden Gate cloning toolkit for vector construction. The toolkit chassis is compatible with the widely accepted Phytobrick standard for genetic parts, and supports assembly of arbitrarily complex T‐DNAs through improved capacity, positional flexibility, and extensibility in comparison to extant kits. We also provision a substantial library of newly adapted Phytobricks, including regulatory elements for monocot and dicot gene expression, and coding sequences for genes of interest such as reporters, developmental regulators, and site‐specific recombinases. Finally, we use a series of dual‐luciferase assays to measure contributions to expression from promoters, terminators, and from cross‐cassette interactions attributable to enhancer elements in certain promoters. Taken together, these publicly available cloning resources can greatly accelerate the testing and deployment of new tools for plant engineering.

    more » « less
  2. Abstract

    Type IIS restriction endonucleases contain separate DNA recognition and catalytic domains and cleave their substrates at well-defined distances outside their target sequences. They are employed in biotechnology for a variety of purposes, including the creation of gene-targeting zinc finger and TAL effector nucleases and DNA synthesis applications such as Golden Gate assembly. The most thoroughly studied Type IIS enzyme, FokI, has been shown to require multimerization and engagement with multiple DNA targets for optimal cleavage activity; however, details of how it or similar enzymes forms a DNA-bound reaction complex have not been described at atomic resolution. Here we describe biochemical analyses of DNA cleavage by the Type IIS PaqCI restriction endonuclease and a series of molecular structures in the presence and absence of multiple bound DNA targets. The enzyme displays a similar tetrameric organization of target recognition domains in the absence or presence of bound substrate, with a significant repositioning of endonuclease domains in a trapped DNA-bound complex that is poised to deliver the first of a series of double-strand breaks. PaqCI and FokI share similar structural mechanisms of DNA cleavage, but considerable differences in their domain organization and quaternary architecture, facilitating comparisons between distinct Type IIS enzymes.

    more » « less
  3. Abstract

    Protocols for the construction of large, deeply mutagenized protein encoding libraries via Golden Gate assembly of synthetic DNA cassettes employ disparate, system‐specific methodology. Here we present a standardized Golden Gate method for building user‐defined libraries. We demonstrate that a 25 μL reaction, using 40 fmol of input DNA, can generate a library on the order of 1 × 106members and that reaction volume or input DNA concentration can be scaled up with no losses in transformation efficiency. Such libraries can be constructed from dsDNA cassettes generated either by degenerate oligonucleotides or oligo pools. We demonstrate its real‐world effectiveness by building custom, user‐defined libraries on the order of 104–107unique protein encoding variants for two orthogonal protein engineering systems. We include a detailed protocol and provide several general‐use destination vectors.

    more » « less
  4. Due to the globalization of Integrated Circuit supply chain, hardware Trojans and the attacks that can trigger them have become an important security issue. One type of hardware Trojans leverages the “don’t care transitions” in Finite-state Machines (FSMs) of hardware designs. In this article, we present a symbolic approach to detecting don’t care transitions and the hidden Trojans. Our detection approach works at both register-transfer level (RTL) and gate level, does not require a golden design, and works in three stages. In the first stage, it explores the reachable states. In the second stage, it performs an approximate analysis to find the don’t care transitions and any discrepancies in the register values or output lines due to don’t care transitions. The second stage can be used for both predicting don’t care triggered Trojans and for guiding don’t care aware reachability analysis. In the third stage, it performs a state-space exploration from reachable states that have incoming don’t care transitions to explore the Trojan payload and to find behavioral discrepancies with respect to what has been observed in the first stage. We also present a pruning technique based on the reachability of FSM states. We present a methodology that leverages both RTL and gate-level for soundness and efficiency. Specifically, we show that don’t care transitions and Trojans that leverage them must be detected at the gate-level, i.e., after synthesis has been performed, for soundness. However, under specific conditions, Trojan payload exploration can be performed more efficiently at RTL. Additionally, the modular design of our approach also provides a fast Trojan prediction method even at the gate level when the reachable states of the FSM is known a priori . Evaluation of our approach on a set of benchmarks from OpenCores and TrustHub and using gate-level representation generated by two synthesis tools, YOSYS and Synopsis Design Compiler (SDC), shows that our approach is both efficient (up to 10× speedup w.r.t. no pruning) and precise (0% false positives both at RTL and gate-level netlist) in detecting don’t care transitions and the Trojans that leverage them. Additionally, the total analysis time can achieve up to 1.62× (using YOSYS) and 1.92× (using SDC) speedup when synthesis preserves the FSM structure, the foundry is trusted, and the Trojan detection is performed at RTL. 
    more » « less
  5. Obeid, I. ; Selesnik, I. ; Picone, J. (Ed.)
    The Neuronix high-performance computing cluster allows us to conduct extensive machine learning experiments on big data [1]. This heterogeneous cluster uses innovative scheduling technology, Slurm [2], that manages a network of CPUs and graphics processing units (GPUs). The GPU farm consists of a variety of processors ranging from low-end consumer grade devices such as the Nvidia GTX 970 to higher-end devices such as the GeForce RTX 2080. These GPUs are essential to our research since they allow extremely compute-intensive deep learning tasks to be executed on massive data resources such as the TUH EEG Corpus [2]. We use TensorFlow [3] as the core machine learning library for our deep learning systems, and routinely employ multiple GPUs to accelerate the training process. Reproducible results are essential to machine learning research. Reproducibility in this context means the ability to replicate an existing experiment – performance metrics such as error rates should be identical and floating-point calculations should match closely. Three examples of ways we typically expect an experiment to be replicable are: (1) The same job run on the same processor should produce the same results each time it is run. (2) A job run on a CPU and GPU should produce identical results. (3) A job should produce comparable results if the data is presented in a different order. System optimization requires an ability to directly compare error rates for algorithms evaluated under comparable operating conditions. However, it is a difficult task to exactly reproduce the results for large, complex deep learning systems that often require more than a trillion calculations per experiment [5]. This is a fairly well-known issue and one we will explore in this poster. Researchers must be able to replicate results on a specific data set to establish the integrity of an implementation. They can then use that implementation as a baseline for comparison purposes. A lack of reproducibility makes it very difficult to debug algorithms and validate changes to the system. Equally important, since many results in deep learning research are dependent on the order in which the system is exposed to the data, the specific processors used, and even the order in which those processors are accessed, it becomes a challenging problem to compare two algorithms since each system must be individually optimized for a specific data set or processor. This is extremely time-consuming for algorithm research in which a single run often taxes a computing environment to its limits. Well-known techniques such as cross-validation [5,6] can be used to mitigate these effects, but this is also computationally expensive. These issues are further compounded by the fact that most deep learning algorithms are susceptible to the way computational noise propagates through the system. GPUs are particularly notorious for this because, in a clustered environment, it becomes more difficult to control which processors are used at various points in time. Another equally frustrating issue is that upgrades to the deep learning package, such as the transition from TensorFlow v1.9 to v1.13, can also result in large fluctuations in error rates when re-running the same experiment. Since TensorFlow is constantly updating functions to support GPU use, maintaining an historical archive of experimental results that can be used to calibrate algorithm research is quite a challenge. This makes it very difficult to optimize the system or select the best configurations. The overall impact of all of these issues described above is significant as error rates can fluctuate by as much as 25% due to these types of computational issues. Cross-validation is one technique used to mitigate this, but that is expensive since you need to do multiple runs over the data, which further taxes a computing infrastructure already running at max capacity. GPUs are preferred when training a large network since these systems train at least two orders of magnitude faster than CPUs [7]. Large-scale experiments are simply not feasible without using GPUs. However, there is a tradeoff to gain this performance. Since all our GPUs use the NVIDIA CUDA® Deep Neural Network library (cuDNN) [8], a GPU-accelerated library of primitives for deep neural networks, it adds an element of randomness into the experiment. When a GPU is used to train a network in TensorFlow, it automatically searches for a cuDNN implementation. NVIDIA’s cuDNN implementation provides algorithms that increase the performance and help the model train quicker, but they are non-deterministic algorithms [9,10]. Since our networks have many complex layers, there is no easy way to avoid this randomness. Instead of comparing each epoch, we compare the average performance of the experiment because it gives us a hint of how our model is performing per experiment, and if the changes we make are efficient. In this poster, we will discuss a variety of issues related to reproducibility and introduce ways we mitigate these effects. For example, TensorFlow uses a random number generator (RNG) which is not seeded by default. TensorFlow determines the initialization point and how certain functions execute using the RNG. The solution for this is seeding all the necessary components before training the model. This forces TensorFlow to use the same initialization point and sets how certain layers work (e.g., dropout layers). However, seeding all the RNGs will not guarantee a controlled experiment. Other variables can affect the outcome of the experiment such as training using GPUs, allowing multi-threading on CPUs, using certain layers, etc. To mitigate our problems with reproducibility, we first make sure that the data is processed in the same order during training. Therefore, we save the data from the last experiment and to make sure the newer experiment follows the same order. If we allow the data to be shuffled, it can affect the performance due to how the model was exposed to the data. We also specify the float data type to be 32-bit since Python defaults to 64-bit. We try to avoid using 64-bit precision because the numbers produced by a GPU can vary significantly depending on the GPU architecture [11-13]. Controlling precision somewhat reduces differences due to computational noise even though technically it increases the amount of computational noise. We are currently developing more advanced techniques for preserving the efficiency of our training process while also maintaining the ability to reproduce models. In our poster presentation we will demonstrate these issues using some novel visualization tools, present several examples of the extent to which these issues influence research results on electroencephalography (EEG) and digital pathology experiments and introduce new ways to manage such computational issues. 
    more » « less