Computer-aided design of biological circuits using TinkerCell

Synthetic biology is an engineering discipline that builds on modeling practices from systems biology and wet-lab techniques from genetic engineering. As synthetic biology advances, efficient procedures will be developed that will allow a synthetic biologist to design, analyze, and build biological networks. In this idealized pipeline, computer-aided design (CAD) is a necessary component. The role of a CAD application would be to allow efficient transition from a general design to a final product. TinkerCell is a design tool for serving this purpose in synthetic biology. In TinkerCell, users build biological networks using biological parts and modules. The network can be analyzed using one of several functions provided by TinkerCell or custom programs from third-party sources. Since best practices for modeling and constructing synthetic biology networks have not yet been established, TinkerCell is designed as a flexible and extensible application that can adjust itself to changes in the field.     

Reconciling taxonomy and phylogenetic inference: formalism and algorithms for describing discord and inferring taxonomic roots

Background

Understanding the evolution of biological networks can provide insight into how their modular structure arises and how they are affected by environmental changes. One approach to studying the evolution of these networks is to reconstruct plausible common ancestors of present-day networks, allowing us to analyze how the topological properties change over time and to posit mechanisms that drive the networks?? evolution. Further, putative ancestral networks can be used to help solve other difficult problems in computational biology, such as network alignment.

Results

We introduce a combinatorial framework for encoding network histories, and we give a fast procedure that, given a set of gene duplication histories, in practice finds network histories with close to the minimum number of interaction gain or loss events to explain the observed present-day networks. In contrast to previous studies, our method does not require knowing the relative ordering of unrelated duplication events. Results on simulated histories and real biological networks both suggest that common ancestral networks can be accurately reconstructed using this parsimony approach. A software package implementing our method is available under the Apache 2.0 license at http://cbcb.umd.edu/kingsford-group/parana.

Conclusions

Our parsimony-based approach to ancestral network reconstruction is both efficient and accurate. We show that considering a larger set of potential ancestral interactions by not assuming a relative ordering of unrelated duplication events can lead to improved ancestral network inference.     

BlaSTorage: a fast package to parse, manage and store BLAST results

Background

Large-scale sequence studies requiring BLAST-based analysis produce huge amounts of data to be parsed. BLAST parsers are available, but they are often missing some important features, such as keeping all information from the raw BLAST output, allowing direct access to single results, and performing logical operations over them.

Findings

We implemented BlaSTorage, a Python package that parses multi BLAST results and returns them in a purpose-built object-database format. Unlike other BLAST parsers, BlaSTorage retains and stores all parts of BLAST results, including alignments, without loss of information; a complete API allows access to all the data components.

Conclusions

BlaSTorage shows comparable speed of more basic parser written in compiled languages as C++ and can be easily integrated into web applications or software pipelines.     

End-to-end automated microfluidic platform for synthetic biology: from design to functional analysis

Background

Synthetic biology aims to engineer biological systems for desired behaviors. The construction of these systems can be complex, often requiring genetic reprogramming, extensive de novo DNA synthesis, and functional screening.

Results

Herein, we present a programmable, multipurpose microfluidic platform and associated software and apply the platform to major steps of the synthetic biology research cycle: design, construction, testing, and analysis. We show the platform’s capabilities for multiple automated DNA assembly methods, including a new method for Isothermal Hierarchical DNA Construction, and for Escherichia coli and Saccharomyces cerevisiae transformation. The platform enables the automated control of cellular growth, gene expression induction, and proteogenic and metabolic output analysis.

Conclusions

Taken together, we demonstrate the microfluidic platform’s potential to provide end-to-end solutions for synthetic biology research, from design to functional analysis.

     

Automatic compilation from high-level biologically-oriented programming language to genetic regulatory networks

Background

The field of synthetic biology promises to revolutionize our ability to engineer biological systems, providing important benefits for a variety of applications. Recent advances in DNA synthesis and automated DNA assembly technologies suggest that it is now possible to construct synthetic systems of significant complexity. However, while a variety of novel genetic devices and small engineered gene networks have been successfully demonstrated, the regulatory complexity of synthetic systems that have been reported recently has somewhat plateaued due to a variety of factors, including the complexity of biology itself and the lag in our ability to design and optimize sophisticated biological circuitry.

Methodology/Principal Findings

To address the gap between DNA synthesis and circuit design capabilities, we present a platform that enables synthetic biologists to express desired behavior using a convenient high-level biologically-oriented programming language, Proto. The high level specification is compiled, using a regulatory motif based mechanism, to a gene network, optimized, and then converted to a computational simulation for numerical verification. Through several example programs we illustrate the automated process of biological system design with our platform, and show that our compiler optimizations can yield significant reductions in the number of genes () and latency of the optimized engineered gene networks.

Conclusions/Significance

Our platform provides a convenient and accessible tool for the automated design of sophisticated synthetic biological systems, bridging an important gap between DNA synthesis and circuit design capabilities. Our platform is user-friendly and features biologically relevant compiler optimizations, providing an important foundation for the development of sophisticated biological systems.     

A survey of enabling technologies in synthetic biology

Background

Realizing constructive applications of synthetic biology requires continued development of enabling technologies as well as policies and practices to ensure these technologies remain accessible for research. Broadly defined, enabling technologies for synthetic biology include any reagent or method that, alone or in combination with associated technologies, provides the means to generate any new research tool or application. Because applications of synthetic biology likely will embody multiple patented inventions, it will be important to create structures for managing intellectual property rights that best promote continued innovation. Monitoring the enabling technologies of synthetic biology will facilitate the systematic investigation of property rights coupled to these technologies and help shape policies and practices that impact the use, regulation, patenting, and licensing of these technologies.

Results

We conducted a survey among a self-identifying community of practitioners engaged in synthetic biology research to obtain their opinions and experiences with technologies that support the engineering of biological systems. Technologies widely used and considered enabling by survey participants included public and private registries of biological parts, standard methods for physical assembly of DNA constructs, genomic databases, software tools for search, alignment, analysis, and editing of DNA sequences, and commercial services for DNA synthesis and sequencing. Standards and methods supporting measurement, functional composition, and data exchange were less widely used though still considered enabling by a subset of survey participants.

Conclusions

The set of enabling technologies compiled from this survey provide insight into the many and varied technologies that support innovation in synthetic biology. Many of these technologies are widely accessible for use, either by virtue of being in the public domain or through legal tools such as non-exclusive licensing. Access to some patent protected technologies is less clear and use of these technologies may be subject to restrictions imposed by material transfer agreements or other contract terms. We expect the technologies considered enabling for synthetic biology to change as the field advances. By monitoring the enabling technologies of synthetic biology and addressing the policies and practices that impact their development and use, our hope is that the field will be better able to realize its full potential.

     

A positive feedback-based gene circuit to increase the production of a membrane protein

Background

Membrane proteins are an important class of proteins, playing a key role in many biological processes, and are a promising target in pharmaceutical development. However, membrane proteins are often difficult to produce in large quantities for the purpose of crystallographic or biochemical analyses.

Results

In this paper, we demonstrate that synthetic gene circuits designed specifically to overexpress certain genes can be applied to manipulate the expression kinetics of a model membrane protein, cytochrome bd quinol oxidase in E. coli, resulting in increased expression rates. The synthetic circuit involved is an engineered, autoinducer-independent variant of the lux operon activator LuxR from V. fischeri in an autoregulatory, positive feedback configuration.

Conclusions

Our proof-of-concept experiments indicate a statistically significant increase in the rate of production of the bd oxidase membrane protein. Synthetic gene networks provide a feasible solution for the problem of membrane protein production.     

A standard vector for the chromosomal integration and characterization of BioBrick™ parts in <Emphasis Type="Italic">Escherichia coli</Emphasis>

Background

The chromosomal integration of biological parts in the host genome enables the engineering of plasmid-free stable strains with single-copy insertions of the desired gene networks. Although different integrative vectors were proposed, no standard pre-assembled genetic tool is available to carry out this task. Synthetic biology concepts can contribute to the development of standardized and user friendly solutions to easily produce engineered strains and to rapidly characterize the desired genetic parts in single-copy context.

Results

In this work we report the design of a novel integrative vector that allows the genomic integration of biological parts compatible with the RFC10, RFC23 and RFC12 BioBrick? standards in Escherichia coli. It can also be specialized by using BioBrick? parts to target the desired integration site in the host genome. The usefulness of this vector has been demonstrated by integrating a set of BioBrick? devices in two different loci of the E. coli chromosome and by characterizing their activity in single-copy. Construct stability has also been evaluated and compared with plasmid-borne solutions.

Conclusions

Physical modularity of biological parts has been successfully applied to construct a ready-to-engineer BioBrick? vector, suitable for a stable chromosomal insertion of standard parts via the desired recombination method, i.e. the bacteriophage integration mechanism or homologous recombination. In contrast with previously proposed solutions, it is a pre-assembled vector containing properly-placed restriction sites for the direct transfer of various formats of BioBrick? parts. This vector can facilitate the characterization of parts avoiding copy number artefacts and the construction of antibiotic resistance-free engineered microbes, suitable for industrial use.

     

Data mining of cancer vaccine trials: a bird's-eye view

Background

Details of the mechanisms and selection pressures that shape the emergence and development of complex biological systems, such as the human immune system, are poorly understood. A recent definition of a reference set of proteins essential for the human immunome, combined with information about protein interaction networks for these proteins, facilitates evolutionary study of this biological machinery.

Results

Here, we present a detailed study of the development of the immunome protein interaction network during eight evolutionary steps from Bilateria ancestors to human. New nodes show preferential attachment to high degree proteins. The efficiency of the immunome protein interaction network increases during the evolutionary steps, whereas the vulnerability of the network decreases.

Conclusion

Our results shed light on selective forces acting on the emergence of biological networks. It is likely that the high efficiency and low vulnerability are intrinsic properties of many biological networks, which arise from the effects of evolutionary processes yet to be uncovered.     

Comparing biological networks via graph compression

Background

Comparison of various kinds of biological data is one of the main problems in bioinformatics and systems biology. Data compression methods have been applied to comparison of large sequence data and protein structure data. Since it is still difficult to compare global structures of large biological networks, it is reasonable to try to apply data compression methods to comparison of biological networks. In existing compression methods, the uniqueness of compression results is not guaranteed because there is some ambiguity in selection of overlapping edges.

Results

This paper proposes novel efficient methods, CompressEdge and CompressVertices, for comparing large biological networks. In the proposed methods, an original network structure is compressed by iteratively contracting identical edges and sets of connected edges. Then, the similarity of two networks is measured by a compression ratio of the concatenated networks. The proposed methods are applied to comparison of metabolic networks of several organisms, H. sapiens, M. musculus, A. thaliana, D. melanogaster, C. elegans, E. coli, S. cerevisiae, and B. subtilis, and are compared with an existing method. These results suggest that our methods can efficiently measure the similarities between metabolic networks.

Conclusions

Our proposed algorithms, which compress node-labeled networks, are useful for measuring the similarity of large biological networks.

     

Sets2Networks: network inference from repeated observations of sets

Background

The skeleton of complex systems can be represented as networks where vertices represent entities, and edges represent the relations between these entities. Often it is impossible, or expensive, to determine the network structure by experimental validation of the binary interactions between every vertex pair. It is usually more practical to infer the network from surrogate observations. Network inference is the process by which an underlying network of relations between entities is determined from indirect evidence. While many algorithms have been developed to infer networks from quantitative data, less attention has been paid to methods which infer networks from repeated co-occurrence of entities in related sets. This type of data is ubiquitous in the field of systems biology and in other areas of complex systems research. Hence, such methods would be of great utility and value.

Results

Here we present a general method for network inference from repeated observations of sets of related entities. Given experimental observations of such sets, we infer the underlying network connecting these entities by generating an ensemble of networks consistent with the data. The frequency of occurrence of a given link throughout this ensemble is interpreted as the probability that the link is present in the underlying real network conditioned on the data. Exponential random graphs are used to generate and sample the ensemble of consistent networks, and we take an algorithmic approach to numerically execute the inference method. The effectiveness of the method is demonstrated on synthetic data before employing this inference approach to problems in systems biology and systems pharmacology, as well as to construct a co-authorship collaboration network. We predict direct protein-protein interactions from high-throughput mass-spectrometry proteomics, integrate data from Chip-seq and loss-of-function/gain-of-function followed by expression data to infer a network of associations between pluripotency regulators, extract a network that connects 53 cancer drugs to each other and to 34 severe adverse events by mining the FDA’s Adverse Events Reporting Systems (AERS), and construct a co-authorship network that connects Mount Sinai School of Medicine investigators. The predicted networks and online software to create networks from entity-set libraries are provided online at http://www.maayanlab.net/S2N.

Conclusions

The network inference method presented here can be applied to resolve different types of networks in current systems biology and systems pharmacology as well as in other fields of research.     

A hybrid microfluidic-vacuum device for direct interfacing with conventional cell culture methods

Background

Microfluidics is an enabling technology with a number of advantages over traditional tissue culture methods when precise control of cellular microenvironment is required. However, there are a number of practical and technical limitations that impede wider implementation in routine biomedical research. Specialized equipment and protocols required for fabrication and setting up microfluidic experiments present hurdles for routine use by most biology laboratories.

Results

We have developed and validated a novel microfluidic device that can directly interface with conventional tissue culture methods to generate and maintain controlled soluble environments in a Petri dish. It incorporates separate sets of fluidic channels and vacuum networks on a single device that allows reversible application of microfluidic gradients onto wet cell culture surfaces. Stable, precise concentration gradients of soluble factors were generated using simple microfluidic channels that were attached to a perfusion system. We successfully demonstrated real-time optical live/dead cell imaging of neural stem cells exposed to a hydrogen peroxide gradient and chemotaxis of metastatic breast cancer cells in a growth factor gradient.

Conclusion

This paper describes the design and application of a versatile microfluidic device that can directly interface with conventional cell culture methods. This platform provides a simple yet versatile tool for incorporating the advantages of a microfluidic approach to biological assays without changing established tissue culture protocols.     

Possible contribution of quantum-like correlations to the placebo effect: consequences on blind trials

Background

Factors that participate in the biological changes associated with a placebo are not completely understood. Natural evolution, mean regression, concomitant procedures and other non specific effects are well-known factors that contribute to the “placebo effect”. In this article, we suggest that quantum-like correlations predicted by a probabilistic modeling could also play a role.

Results

An elementary experiment in biology or medicine comparing the biological changes associated with two placebos is modeled. The originality of this modeling is that experimenters, biological system and their interactions are described together from the standpoint of a participant who is uninvolved in the measurement process. Moreover, the small random probability fluctuations of a “real” experiment are also taken into account. If both placebos are inert (with only different labels), common sense suggests that the biological changes associated with the two placebos should be comparable. However, the consequence of this modeling is the possibility for two placebos to be associated with different outcomes due to the emergence of quantum-like correlations.

Conclusion

The association of two placebos with different outcomes is counterintuitive and this modeling could give a framework for some unexplained observations where mere placebos are compared (in some alternative medicines for example). This hypothesis can be tested in blind trials by comparing local vs. remote assessment of correlations.

     

Counting motifs in dynamic networks

Background

A network motif is a sub-network that occurs frequently in a given network. Detection of such motifs is important since they uncover functions and local properties of the given biological network. Finding motifs is however a computationally challenging task as it requires solving the costly subgraph isomorphism problem. Moreover, the topology of biological networks change over time. These changing networks are called dynamic biological networks. As the network evolves, frequency of each motif in the network also changes. Computing the frequency of a given motif from scratch in a dynamic network as the network topology evolves is infeasible, particularly for large and fast evolving networks.

Results

In this article, we design and develop a scalable method for counting the number of motifs in a dynamic biological network. Our method incrementally updates the frequency of each motif as the underlying network’s topology evolves. Our experiments demonstrate that our method can update the frequency of each motif in orders of magnitude faster than counting the motif embeddings every time the network changes. If the network evolves more frequently, the margin with which our method outperforms the existing static methods, increases.

Conclusions

We evaluated our method extensively using synthetic and real datasets, and show that our method is highly accurate(≥?96%) and that it can be scaled to large dense networks. The results on real data demonstrate the utility of our method in revealing interesting insights on the evolution of biological processes.

     

A modified particle swarm optimization algorithm for parameter estimation of a biological system

Background

Mathematical modeling has achieved a broad interest in the field of biology. These models represent the associations among the metabolism of the biological phenomenon with some mathematical equations such that the observed time course profile of the biological data fits the model. However, the estimation of the unknown parameters of the model is a challenging task. Many algorithms have been developed for parameter estimation, but none of them is entirely capable of finding the best solution. The purpose of this paper is to develop a method for precise estimation of parameters of a biological model.

Methods

In this paper, a novel particle swarm optimization algorithm based on a decomposition technique is developed. Then, its root mean square error is compared with simple particle swarm optimization, Iterative Unscented Kalman Filter and Simulated Annealing algorithms for two different simulation scenarios and a real data set related to the metabolism of CAD system.

Results

Our proposed algorithm results in 54.39% and 26.72% average reduction in root mean square error when applied to the simulation and experimental data, respectively.

Conclusion

The results show that the metaheuristic approaches such as the proposed method are very wise choices for finding the solution of nonlinear problems with many unknown parameters.

     

Determining modular organization of protein interaction networks by maximizing modularity density

Background

With ever increasing amount of available data on biological networks, modeling and understanding the structure of these large networks is an important problem with profound biological implications. Cellular functions and biochemical events are coordinately carried out by groups of proteins interacting each other in biological modules. Identifying of such modules in protein interaction networks is very important for understanding the structure and function of these fundamental cellular networks. Therefore, developing an effective computational method to uncover biological modules should be highly challenging and indispensable.

Results

The purpose of this study is to introduce a new quantitative measure modularity density into the field of biomolecular networks and develop new algorithms for detecting functional modules in protein-protein interaction (PPI) networks. Specifically, we adopt the simulated annealing (SA) to maximize the modularity density and evaluate its efficiency on simulated networks. In order to address the computational complexity of SA procedure, we devise a spectral method for optimizing the index and apply it to a yeast PPI network.

Conclusions

Our analysis of detected modules by the present method suggests that most of these modules have well biological significance in context of protein complexes. Comparison with the MCL and the modularity based methods shows the efficiency of our method.