اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدModular model building
108
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Mathematical models are increasingly used in both academia and the pharmaceutical industry to understand how phenotypes emerge from systems of molecular interactions. However, their current construction as monolithic sets of equations presents a fundamental barrier to progress. Overcoming this requires modularity, enabling sub-systems to be specified independently and combined incrementally, and abstraction, enabling general properties to be specified independently of specific instances. These in turn require models to be represented as programs rather than as datatypes. Programmable modularity and abstraction enables libraries of modules to be created for generic biological processes, which can be instantiated and re-used repeatedly in different contexts with different components. We have developed a computational infrastructure to support this. We show here why these capabilities are needed, what is required to implement them and what can be accomplished with them that could not be done previously.
قيم البحث
اقرأ أيضاً
The architecture of biological networks has been reported to exhibit high level of modularity, and to some extent, topological modules of networks overlap with known functional modules. However, how the modular topology of the molecular network affec
ts the evolution of its member proteins remains unclear. In this work, the functional and evolutionary modularity of Homo sapiens (H. sapiens) metabolic network were investigated from a topological point of view. Network decomposition shows that the metabolic network is organized in a highly modular core-periphery way, in which the core modules are tightly linked together and perform basic metabolism functions, whereas the periphery modules only interact with few modules and accomplish relatively independent and specialized functions. Moreover, over half of the modules exhibit co-evolutionary feature and belong to specific evolutionary ages. Peripheral modules tend to evolve more cohesively and faster than core modules do. The correlation between functional, evolutionary and topological modularity suggests that the evolutionary history and functional requirements of metabolic systems have been imprinted in the architecture of metabolic networks. Such systems level analysis could demonstrate how the evolution of genes may be placed in a genome-scale network context, giving a novel perspective on molecular evolution.
Synthetic biology brings together concepts and techniques from engineering and biology. In this field, computer-aided design (CAD) is necessary in order to bridge the gap between computational modeling and biological data. An application named Tinker
Cell has been created in order to serve as a CAD tool for synthetic biology. TinkerCell is a visual modeling tool that supports a hierarchy of biological parts. Each part in this hierarchy consists of a set of attributes that define the part, such as sequence or rate constants. Models that are constructed using these parts can be analyzed using various C and Python programs that are hosted by TinkerCell via an extensive C and Python API. TinkerCell supports the notion of a module, which are networks with interfaces. Such modules can be connected to each other, forming larger modular networks. Because TinkerCell associates parameters and equations in a model with their respective part, parts can be loaded from databases along with their parameters and rate equations. The modular network design can be used to exchange modules as well as test the concept of modularity in biological systems. The flexible modeling framework along with the C and Python API allows TinkerCell to serve as a host to numerous third-party algorithms. TinkerCell is a free and open-source project under the Berkeley Software Distribution license. Downloads, documentation, and tutorials are available at www.tinkercell.com.
In this contribution, a design of a synthetic calibration genetic circuit to characterize the relative strength of different sensing promoters is proposed and its specifications and performance are analyzed via an effective mathematical model. Our ca
librator device possesses certain novel and useful features like modularity (and thus the possibility of being used in many different biological contexts), simplicity, being based on a single cell, high sensitivity and fast response. To uncover the critical model parameters and the corresponding parameter domain at which the calibrator performance will be optimal, a sensitivity analysis of the model parameters was carried out over a given range of sensing protein concentrations (acting as input). Our analysis suggests that the half saturation constants for repression, sensing and difference in binding cooperativity (Hill coefficients) for repression are the key to the performance of the proposed device. They furthermore are determinant for the sensing speed of the device, showing that it is possible to produce detectable differences in the repression protein concentrations and in turn in the corresponding fluorescence in less than two hours. This analysis paves the way for the design, experimental construction and validation of a new family of functional genetic circuits for the purpose of calibrating promoters.
Many biological networks have been labelled scale-free as their degree distribution can be approximately described by a powerlaw distribution. While the degree distribution does not summarize all aspects of a network it has often been suggested that
its functional form contains important clues as to underlying evolutionary processes that have shaped the network. Generally determining the appropriate functional form for the degree distribution has been fitted in an ad-hoc fashion. Here we apply formal statistical model selection methods to determine which functional form best describes degree distributions of protein interaction and metabolic networks. We interpret the degree distribution as belonging to a class of probability models and determine which of these models provides the best description for the empirical data using maximum likelihood inference, composite likelihood methods, the Akaike information criterion and goodness-of-fit tests. The whole data is used in order to determine the parameter that best explains the data under a given model (e.g. scale-free or random graph). As we will show, present protein interaction and metabolic network data from different organisms suggests that simple scale-free models do not provide an adequate description of real network data.
We have developed a mathematical model of transcriptional activation by MarA in Escherichia coli, and used the model to analyze measurements of MarA-dependent activity of the marRAB, sodA, and micF promoters in mar-rob- cells. The model rationalizes
an unexpected poor correlation between the mid-point of in vivo promoter activity profiles and in vitro equilibrium constants for MarA binding to promoter sequences. Analysis of the promoter activity data using the model yielded the following predictions regarding activation mechanisms: (1) MarA activation of the marRAB, sodA, and micF promoters involves a net acceleration of the kinetics of transitions after RNA polymerase binding, up to and including promoter escape and message elongation; (2) RNA polymerase binds to these promoters with nearly unit occupancy in the absence of MarA, making recruitment of polymerase an insignificant factor in activation of these promoters; and (3) instead of recruitment, activation of the micF promoter might involve a repulsion of polymerase combined with a large acceleration of the kinetics of polymerase activity. These predictions are consistent with published chromatin immunoprecipitation assays of interactions between polymerase and the E. coli chromosome. A lack of recruitment in transcriptional activation represents an exception to the textbook description of activation of bacterial sigma-70 promoters. However, use of accelerated polymerase kinetics instead of recruitment might confer a competitive advantage to E. coli by decreasing latency in gene regulation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
