Search

Biomolecular network dynamics are thought to operate near the critical boundary between ordered and disordered regimes, where large perturbations to a small set of elements neither die out nor spread on average. A biomolecular automaton (e.g., gene, protein) typically has high regulatory redundancy, where small subsets of regulators determine activation via collective canalization. Previous work has shown that effective connectivity, a measure of collective canalization, leads to improved dynamical regime prediction for homogeneous automata networks. We expand this by (i) studying random Boolean networks (RBNs) with heterogeneous in-degree distributions, (ii) considering additional experimentally validated automata network models of biomolecular processes, and (iii) considering new measures of heterogeneity in automata network logic. We found that effective connectivity improves dynamical regime prediction in the models considered; in RBNs, combining effective connectivity with bias entropy further improves the prediction. Our work yields a new understanding of criticality in biomolecular networks that accounts for collective canalization, redundancy, and heterogeneity in the connectivity and logic of their automata models. The strong link we demonstrate between criticality and regulatory redundancy provides a means to modulate the dynamical regime of biochemical networks. [ABSTRACT FROM AUTHOR]

Background: With a growing amount of (multi-)omics data being available, the extraction of knowledge from these datasets is still a difficult problem. Classical enrichment-style analyses require predefined pathways or gene sets that are tested for significant deregulation to assess whether the pathway is functionally involved in the biological process under study. De novo identification of these pathways can reduce the bias inherent in predefined pathways or gene sets. At the same time, the definition and efficient identification of these pathways de novo from large biological networks is a challenging problem. Results: We present a novel algorithm, DeRegNet, for the identification of maximally deregulated subnetworks on directed graphs based on deregulation scores derived from (multi-)omics data. DeRegNet can be interpreted as maximum likelihood estimation given a certain probabilistic model for de-novo subgraph identification. We use fractional integer programming to solve the resulting combinatorial optimization problem. We can show that the approach outperforms related algorithms on simulated data with known ground truths. On a publicly available liver cancer dataset we can show that DeRegNet can identify biologically meaningful subgraphs suitable for patient stratification. DeRegNet can also be used to find explicitly multi-omics subgraphs which we demonstrate by presenting subgraphs with consistent methylation-transcription patterns. DeRegNet is freely available as open-source software. Conclusion: The proposed algorithmic framework and its available implementation can serve as a valuable heuristic hypothesis generation tool contextualizing omics data within biomolecular networks. [ABSTRACT FROM AUTHOR]

Highlights • Positive feedback in regulatory circuits can trap system in control-robust behavior. • Analysis of ODE models is informed by analogies with Boolean systems. • Subsystem behavior can place bounds on the effectiveness of system interventions. Abstract We consider a dynamic framework frequently used to model gene regulatory and signal transduction networks: monotonic ODEs that are composed of Hill functions. We derive conditions under which activity or inactivity in one system variable induces and sustains activity or inactivity in another. Cycles of such influences correspond to positive feedback loops that are self-sustaining and control-robust, in the sense that these feedback loops "trap" the system in a region of state space from which it cannot exit, even if the other system variables are externally controlled. To demonstrate the utility of this result, we consider prototypical examples of bistability and hysteresis in gene regulatory networks, and analyze a T-cell signal transduction ODE model from the literature. [ABSTRACT FROM AUTHOR]

Within the eukaryotic cell, more than 1000 species of lipids define a series of membranes essential for cell function. Tightly controlled systems of lipid transport underlie the proper spatiotemporal distribution of membrane lipids, the coordination of spatially separated lipid metabolic pathways, and lipid signaling mediated by soluble proteins that may be localized some distance away from membranes. Alongside the well-established vesicular transport of lipids, non-vesicular transport mediated by a group of proteins referred to as lipid-transfer proteins (LTPs) is emerging as a key mechanism of lipid transport in a broad range of biological processes. More than a hundred LTPs exist in humans and these can be divided into at least ten protein families. LTPs are widely distributed in tissues, organelles and membrane contact sites (MCSs), as well as in the extracellular space. They all possess a soluble and globular domain that encapsulates a lipid monomer and they specifically bind and transport a wide range of lipids. Here, we present the most recent discoveries in the functions and physiological roles of LTPs, which have expanded the playground of lipids into the aqueous spaces of cells. [ABSTRACT FROM AUTHOR]

Background: Network-based learning algorithms for automated function prediction (AFP) are negatively affected by the limited coverage of experimental data and limited a priori known functional annotations. As a consequence their application to model organisms is often restricted to well characterized biological processes and pathways, and their effectiveness with poorly annotated species is relatively limited. A possible solution to this problem might consist in the construction of big networks including multiple species, but this in turn poses challenging computational problems, due to the scalability limitations of existing algorithms and the main memory requirements induced by the construction of big networks. Distributed computation or the usage of big computers could in principle respond to these issues, but raises further algorithmic problems and require resources not satisfiable with simple off-the-shelf computers. Results: We propose a novel framework for scalable network-based learning of multi-species protein functions based on both a local implementation of existing algorithms and the adoption of innovative technologies: we solve "locally" the AFP problem, by designing "vertex-centric" implementations of network-based algorithms, but we do not give up thinking "globally" by exploiting the overall topology of the network. This is made possible by the adoption of secondary memory-based technologies that allow the efficient use of the large memory available on disks, thus overcoming the main memory limitations of modern off-the-shelf computers. This approach has been applied to the analysis of a large multi-species network including more than 300 species of bacteria and to a network with more than 200,000 proteins belonging to 13 Eukaryotic species. To our knowledge this is the first work where secondary-memory based network analysis has been applied to multi-species function prediction using biological networks with hundreds of thousands of proteins. Conclusions: The combination of these algorithmic and technological approaches makes feasible the analysis of large multi-species networks using ordinary computers with limited speed and primary memory, and in perspective could enable the analysis of huge networks (e.g. the whole proteomes available in SwissProt), using well-equipped stand-alone machines. [ABSTRACT FROM AUTHOR]

Abstract: We discuss some motivational challenges arising from the need to model and analyse complex biological systems at multiple scales (spatial and temporal), and present a biomodel engineering framework to address some of these issues within the context of multiscale Systems Biology. Our methodology is based on a structured family of Petri net classes which enables the investigation of a given system using various modelling abstractions: qualitative, stochastic, continuous and hybrid, optionally in a spatial context. We illustrate our approach with case studies demonstrating hierarchical flattening, treatment of space, and hierarchical organisation of space. [Copyright &y& Elsevier]

Complex biological systems manifest a large variety of emergent phenomena among which prominent roles belong to selforganization and swarm intelligence. Generally, each level in a biological hierarchy possesses its own systemic properties and requires its own way of observation, conceptualization, and modeling. In this work, an attempt is made to outline general guiding principles in exploration of a wide range of seemingly dissimilar phenomena observed in large communities of individuals devoid of any personal intelligence and interacting with each other through simple stimulus-response rules. Mathematically, these guiding principles are well captured by the Global Consensus Theorem (GCT) equally applicable to neural networks and to Lotka-Volterra population dynamics. Universality of the mechanistic principles outlined by GCT allows for a unified approach to such diverse systems as biological networks, communities of social insects, robotic communities, microbial communities, communities of somatic cells, social networks and many other systems. Another cluster of universal laws governing the self-organization in large communities of locally interacting individuals is built around the principle of self-organized criticality (SOC). The GCT and SOC, separately or in combination, provide a conceptual basis for understanding the phenomena of self-organization occurring in large communities without involvement of a supervisory authority, without system-wide informational infrastructure, and without mapping of general plan of action onto cognitive/ behavioral faculties of its individual members. Cancer onset and proliferation serves as an important example of application of these conceptual approaches. In this paper, the point of view is put forward that apparently irreconcilable contradictions between two opposing theories of carcinogenesis, that is, the Somatic Mutation Theory and the Tissue Organization Field Theory, may be resolved using the systemic approaches provided by GST and SOC. [ABSTRACT FROM AUTHOR]

Abstract: Various approaches attempting to infer the functional interaction structure of a hidden biomolecular network from experimental time-series measurements have been developed; however, due to both experimental limitations and methodological complexities, a large majority of these approaches have been unsuccessful. In particular, with respect to the elucidation of such networks, there are (i) a dimensionality problem: too many network nodes with too few available sampling points, (ii) a computational complexity problem: exponential complexity if a priori information is unavailable for regulatory nodes, and (iii) an experimental measurement problem: no guidelines for an appropriate experimental design for distinguishing direct and indirect influences among network nodes. Here, we sought to develop a new methodology capable of identifying the correct functional interaction structure with only a few sampling points through relatively simple computations. We also attempted to provide guidelines for an experimental design capable of supporting this methodology by taking proper measurements of the direct influences among the network nodes. In the present study, we considered an experiment where measurements were taken at two sampling time points with alternate perturbation (up-regulation or down-regulation) of initial conditions while keeping the same initial conditions for unperturbed network nodes, and propose a new method of identifying the functional interaction structure from such measurements. The proposed method is able to avoid the dimensionality problem caused by the practically limited number of sampling time points, and does not suffer from the computational complexity problem, as it only uses a simple algebra based on the Mean Value Theorem (see ) without any other complicated computation. In addition, we provide a detailed guideline for an experimental design that can take proper measurements of the direct influences among the network nodes through perturbation of initial conditions. The proposed method is particularly useful for cases investigating the local interaction structure around a specific network node of interest. An example, based on simulated data, is provided to illustrate the proposed method. [Copyright &y& Elsevier]

Microarray-based characterization of tissues, cellular and disease states, and environmental condition and treatment responses provides genome-wide snapshots containing large amounts of invaluable information. However, the lack of inherent structure within the data and strong noise make extracting and interpreting this information and formulating and prioritizing domain relevant hypotheses difficult tasks. Integration with different types of biological data is required to place the expression measurements into a biologically meaningful context. A few approaches in microarray data interpretation are discussed with the emphasis on the use of molecular network information. Statistical procedures are demonstrated that superimpose expression data onto the transcription regulation network mined from scientific literature and aim at selecting transcription regulators with significant patterns of expression changes downstream. Tests are suggested that take into account network topology and signs of transcription regulation effects. The approaches are illustrated using two different expression datasets, the performance is compared, and biological relevance of the predictions is discussed. [ABSTRACT FROM AUTHOR]

Abstract: We propose a unified framework for the identification of functional interaction structures of biomolecular networks in a way that leads to a new experimental design procedure. In developing our approach, we have built upon previous work. Thus we begin by pointing out some of the restrictions associated with existing structure identification methods and point out how these restrictions may be eased. In particular, existing methods use specific forms of experimental algebraic equations with which to identify the functional interaction structure of a biomolecular network. In our work, we employ an extended form of these experimental algebraic equations which, while retaining their merits, also overcome some of their disadvantages. Experimental data are required in order to estimate the coefficients of the experimental algebraic equation set associated with the structure identification task. However, experimentalists are rarely provided with guidance on which parameters to perturb, and to what extent, to perturb them. When a model of network dynamics is required then there is also the vexed question of sample rate and sample time selection to be resolved. Supplying some answers to these questions is the main motivation of this paper. The approach is based on stationary and/or temporal data obtained from parameter perturbations, and unifies the previous approaches of Kholodenko et al. (PNAS 99 (2002) 12841–12846) and Sontag et al. (Bioinformatics 20 (2004) 1877–1886). By way of demonstration, we apply our unified approach to a network model which cannot be properly identified by existing methods. Finally, we propose an experiment design methodology, which is not limited by the amount of parameter perturbations, and illustrate its use with an in numero example. [Copyright &y& Elsevier]