Minimal intervening control of biomolecular networks leading to a desired cellular state.
Ontology highlight
ABSTRACT:
SUBMITTER: Choo SM
PROVIDER: S-EPMC6739335 | biostudies-literature | 2019 Sep
REPOSITORIES: biostudies-literature
Publications
Minimal intervening control of biomolecular networks leading to a desired cellular state.
Choo Sang-Mok SM Park Sang-Min SM Cho Kwang-Hyun KH
Scientific reports 20190911 1
A cell phenotype can be represented by an attractor state of the underlying molecular regulatory network, to which other network states eventually converge. Here, the set of states converging to each attractor is called its basin of attraction. A central question is how to drive a particular cell state toward a desired attractor with minimal interventions on the network system. We develop a general control framework of complex Boolean networks to provide an answer to this question by identifying ...[more]
Similar Datasets
Project description:Identifying a critical transition and its leading biomolecular network during the initiation and progression of a complex disease is a challenging task, but holds the key to early diagnosis and further elucidation of the essential mechanisms of disease deterioration at the network level. In this study, we developed a novel computational method for identifying early-warning signals of the critical transition and its leading network during a disease progression, based on high-throughput data using a small number of samples. The leading network makes the first move from the normal state toward the disease state during a transition, and thus is causally related with disease-driving genes or networks. Specifically, we first define a state-transition-based local network entropy (SNE), and prove that SNE can serve as a general early-warning indicator of any imminent transitions, regardless of specific differences among systems. The effectiveness of this method was validated by functional analysis and experimental data.
| S-EPMC3517980 | biostudies-literature
Project description:The formation of biomolecular condensates mediated by a coupling of associative and segregative phase transitions plays a critical role in controlling diverse cellular functions in nature. This has inspired the use of phase transitions to design synthetic systems. While design rules of phase transitions have been established for many synthetic intrinsically disordered proteins, most efforts have focused on investigating their phase behaviors in a test tube. Here, we present a rational engineering approach to program the formation and physical properties of synthetic condensates to achieve intended cellular functions. We demonstrate this approach through targeted plasmid sequestration and transcription regulation in bacteria and modulation of a protein circuit in mammalian cells. Our approach lays the foundation for engineering designer condensates for synthetic biology applications.
| S-EPMC10786170 | biostudies-literature
Project description:MotivationCellular behavior is determined by complex non-linear interactions between numerous intracellular molecules that are often represented by Boolean network models. To achieve a desired cellular behavior with minimal intervention, we need to identify optimal control targets that can drive heterogeneous cellular states to the desired phenotypic cellular state with minimal node intervention. Previous attempts to realize such global stabilization were based solely on either network structure information or simple linear dynamics. Other attempts based on non-linear dynamics are not scalable.ResultsHere, we investigate the underlying relationship between structurally identified control targets and optimal global stabilizing control targets based on non-linear dynamics. We discovered that optimal global stabilizing control targets can be identified by analyzing the dynamics between structurally identified control targets. Utilizing these findings, we developed a scalable global stabilizing control framework using both structural and dynamic information. Our framework narrows down the search space based on strongly connected components and feedback vertex sets then identifies global stabilizing control targets based on the canalization of Boolean network dynamics. We find that the proposed global stabilizing control is superior with respect to the number of control target nodes, scalability, and computational complexity.Availability and implementationWe provide a GitHub repository that contains the DCGS framework written in Python as well as biological random Boolean network datasets (https://github.com/sugyun/DCGS).Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC9891247 | biostudies-literature
Project description:BackgroundBiomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As biomolecular networks grow in size and complexity, the model of a biomolecular network must become more rigorous to keep track of all the components and their interactions. In general this presents the need for computer simulation to manipulate and understand the biomolecular network model.ResultsIn this paper, we present a novel method to model the regulatory system which executes a cellular function and can be represented as a biomolecular network. Our method consists of two steps. First, a novel scale-free network clustering approach is applied to the large-scale biomolecular network to obtain various sub-networks. Second, a state-space model is generated for the sub-networks and simulated to predict their behavior in the cellular context. The modeling results represent hypotheses that are tested against high-throughput data sets (microarrays and/or genetic screens) for both the natural system and perturbations. Notably, the dynamic modeling component of this method depends on the automated network structure generation of the first component and the sub-network clustering, which are both essential to make the solution tractable.ConclusionExperimental results on time series gene expression data for the human cell cycle indicate our approach is promising for sub-network mining and simulation from large-scale biomolecular network.
| S-EPMC2213691 | biostudies-literature
Project description:We consider networks of dynamical units that evolve in time according to different laws, and are coupled to each other in highly irregular ways. Studying how to steer the dynamics of such systems towards a desired evolution is of great practical interest in many areas of science, as well as providing insight into the interplay between network structure and dynamical behavior. We propose a pinning protocol for imposing specific dynamic evolutions compatible with the equations of motion on a networked system. The method does not impose any restrictions on the local dynamics, which may vary from node to node, nor on the interactions between nodes, which may adopt in principle any nonlinear mathematical form and be represented by weighted, directed or undirected links. We first explore our method on small synthetic networks of chaotic oscillators, which allows us to unveil a correlation between the ordered sequence of pinned nodes and their topological influence in the network. We then consider a 12-species trophic web network, which is a model of a mammalian food web. By pinning a relatively small number of species, one can make the system abandon its spontaneous evolution from its (typically uncontrolled) initial state towards a target dynamics, or periodically control it so as to make the populations evolve within stipulated bounds. The relevance of these findings for environment management and conservation is discussed.
| S-EPMC7695727 | biostudies-literature
Project description:Layered feedback is an optimization strategy in feedback control designs widely used in engineering. Control theory suggests that layering multiple feedbacks could overcome the robustness-speed performance trade-off limit. In natural biological networks, genes are often regulated in layers to adapt to environmental perturbations. It is hypothesized layering architecture could also overcome the robustness-speed performance trade-off in genetic networks. In this work, we validate this hypothesis with a synthetic biomolecular network in living E. coli cells. We start with system dynamics analysis using models of various complexities to guide the design of a layered control architecture in living cells. Experimentally, we interrogate system dynamics under three groups of perturbations. We consistently observe that the layered control improves system performance in the robustness-speed domain. This work confirms that layered control could be adopted in synthetic biomolecular networks for performance optimization. It also provides insights into understanding genetic feedback control architectures in nature.
| S-EPMC9474519 | biostudies-literature
Project description:BACKGROUND: One of the most important goals of the mathematical modeling of gene regulatory networks is to alter their behavior toward desirable phenotypes. Therapeutic techniques are derived for intervention in terms of stationary control policies. In large networks, it becomes computationally burdensome to derive an optimal control policy. To overcome this problem, greedy intervention approaches based on the concept of the Mean First Passage Time or the steady-state probability mass of the network states were previously proposed. Another possible approach is to use reduction mappings to compress the network and develop control policies on its reduced version. However, such mappings lead to loss of information and require an induction step when designing the control policy for the original network. RESULTS: In this paper, we propose a novel solution, CoD-CP, for designing intervention policies for large Boolean networks. The new method utilizes the Coefficient of Determination (CoD) and the Steady-State Distribution (SSD) of the model. The main advantage of CoD-CP in comparison with the previously proposed methods is that it does not require any compression of the original model, and thus can be directly designed on large networks. The simulation studies on small synthetic networks shows that CoD-CP performs comparable to previously proposed greedy policies that were induced from the compressed versions of the networks. Furthermore, on a large 17-gene gastrointestinal cancer network, CoD-CP outperforms other two available greedy techniques, which is precisely the kind of case for which CoD-CP has been developed. Finally, our experiments show that CoD-CP is robust with respect to the attractor structure of the model. CONCLUSIONS: The newly proposed CoD-CP provides an attractive alternative for intervening large networks where other available greedy methods require size reduction on the network and an extra induction step before designing a control policy.
| S-EPMC3236832 | biostudies-other
Project description:BACKGROUND: Type 1 diabetes (T1D) is a complex disease and harmful to human health, and most of the existing biomarkers are mainly to measure the disease phenotype after the disease onset (or drastic deterioration). Until now, there is no effective biomarker which can predict the upcoming disease (or pre-disease state) before disease onset or disease deterioration. Further, the detail molecular mechanism for such deterioration of the disease, e.g., driver genes or causal network of the disease, is still unclear. METHODS: In this study, we detected early-warning signals of T1D and its leading biomolecular networks based on serial gene expression profiles of NOD (non-obese diabetic) mice by identifying a new type of biomarker, i.e., dynamical network biomarker (DNB) which forms a specific module for marking the time period just before the drastic deterioration of T1D. RESULTS: Two dynamical network biomarkers were obtained to signal the emergence of two critical deteriorations for the disease, and could be used to predict the upcoming sudden changes during the disease progression. We found that the two critical transitions led to peri-insulitis and hyperglycemia in NOD mice, which are consistent with other independent experimental results from literature. CONCLUSIONS: The identified dynamical network biomarkers can be used to detect the early-warning signals of T1D and predict upcoming disease onset before the drastic deterioration. In addition, we also demonstrated that the leading biomolecular networks are causally related to the initiation and progression of T1D, and provided the biological insight into the molecular mechanism of T1D. Experimental data from literature and functional analysis on DNBs validated the computational results.
| S-EPMC3654886 | biostudies-literature
Project description:MotivationRecent efforts to manipulate various microbial communities, such as fecal microbiota transplant and bioreactor systems' optimization, suggest a promising route for microbial community engineering with numerous medical, environmental and industrial applications. However, such applications are currently restricted in scale and often rely on mimicking or enhancing natural communities, calling for the development of tools for designing synthetic communities with specific, tailored, desired metabolic capacities.ResultsHere, we present a first step toward this goal, introducing a novel algorithm for identifying minimal sets of microbial species that collectively provide the enzymatic capacity required to synthesize a set of desired target product metabolites from a predefined set of available substrates. Our method integrates a graph theoretic representation of network flow with the set cover problem in an integer linear programming (ILP) framework to simultaneously identify possible metabolic paths from substrates to products while minimizing the number of species required to catalyze these metabolic reactions. We apply our algorithm to successfully identify minimal communities both in a set of simple toy problems and in more complex, realistic settings, and to investigate metabolic capacities in the gut microbiome. Our framework adds to the growing toolset for supporting informed microbial community engineering and for ultimately realizing the full potential of such engineering efforts.Availability and implementationThe algorithm source code, compilation, usage instructions and examples are available under a non-commercial research use only license at https://github.com/borenstein-lab/CoMiDA CONTACT: elbo@uw.eduSupplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC4920118 | biostudies-literature
Project description:Spatial organisation through localisation/compartmentalisation of species is a ubiquitous but poorly understood feature of cellular biomolecular networks. Current technologies in systems and synthetic biology (spatial proteomics, imaging, synthetic compartmentalisation) necessitate a systematic approach to elucidating the interplay of networks and spatial organisation. We develop a systems framework towards this end and focus on the effect of spatial localisation of network components revealing its multiple facets: (i) As a key distinct regulator of network behaviour, and an enabler of new network capabilities (ii) As a potent new regulator of pattern formation and self-organisation (iii) As an often hidden factor impacting inference of temporal networks from data (iv) As an engineering tool for rewiring networks and network/circuit design. These insights, transparently arising from the most basic considerations of networks and spatial organisation, have broad relevance in natural and engineered biology and in related areas such as cell-free systems, systems chemistry and bionanotechnology.
| S-EPMC8429635 | biostudies-literature