Model identification of signal transduction networks from data using a state regulator problem

Advances in molecular biology provide an opportunity to develop detailed models of biological processes that can be used to obtain an integrated understanding of the system. However, development of useful models from the available knowledge of the system and experimental observations still remains a daunting task. In this work, a model identification strategy for complex biological networks is proposed. The approach includes a state regulator problem (SRP) that provides estimates of all the component concentrations and the reaction rates of the network using the available measurements. The full set of the estimates is utilised for model parameter identification for the network of known topology. An a priori model complexity test that indicates the feasibility of performance of the proposed algorithm is developed. Fisher information matrix (FIM) theory is used to address model identifiability issues. Two signalling pathway case studies, the caspase function in apoptosis and the MAP kinase cascade system, are considered. The MAP kinase cascade, with measurements restricted to protein complex concentrations, fails the a priori test and the SRP estimates are poor as expected. The apoptosis network structure used in this work has moderate complexity and is suitable for application of the proposed tools. Using a measurement set of seven protein concentrations, accurate estimates for all unknowns are obtained. Furthermore, the effects of measurement sampling frequency and quality of information in the measurement set on the performance of the identified model are described.     

The metacommunity concept: a framework for multi-scale community ecology

The metacommunity concept is an important way to think about linkages between different spatial scales in ecology. Here we review current understanding about this concept. We first investigate issues related to its definition as a set of local communities that are linked by dispersal of multiple potentially interacting species. We then identify four paradigms for metacommunities: the patch‐dynamic view, the species‐sorting view, the mass effects view and the neutral view, that each emphasizes different processes of potential importance in metacommunities. These have somewhat distinct intellectual histories and we discuss elements related to their potential future synthesis. We then use this framework to discuss why the concept is useful in modifying existing ecological thinking and illustrate this with a number of both theoretical and empirical examples. As ecologists strive to understand increasingly complex mechanisms and strive to work across multiple scales of spatio‐temporal organization, concepts like the metacommunity can provide important insights that frequently contrast with those that would be obtained with more conventional approaches based on local communities alone.     

Diversity indices for ecological networks: a unifying framework using Hill numbers

Describing how ecological interactions change over space and time and how they are shaped by environmental conditions is crucial to understand and predict ecosystem trajectories. However, it requires having an appropriate framework to measure network diversity locally, regionally and between samples (α‐, γ‐ and β‐diversity). Here, we propose a unifying framework that builds on Hill numbers and accounts both for the probabilistic nature of biotic interactions and the abundances of species or groups. We emphasise the importance of analysing network diversity across different species aggregation levels (e.g. from species to trophic groups) to get a better understanding of network structure. We illustrate our framework with a simulation experiment and an empirical analysis using a global food‐web database. We discuss further usages of the framework and show how it responds to recent calls on comparing ecological networks and analysing their variation across environmental gradients and time.     

Modeling allosteric signal propagation using protein structure networks

Allosteric communication in proteins can be induced by the binding of effective ligands, mutations or covalent modifications that regulate a site distant from the perturbed region. To understand allosteric regulation, it is important to identify the remote sites that are affected by the perturbation-induced signals and how these allosteric perturbations are transmitted within the protein structure. In this study, by constructing a protein structure network and modeling signal transmission with a Markov random walk, we developed a method to estimate the signal propagation and the resulting effects. In our model, the global perturbation effects from a particular signal initiation site were estimated by calculating the expected visiting time (EVT), which describes the signal-induced effects caused by signal transmission through all possible routes. We hypothesized that the residues with high EVT values play important roles in allosteric signaling. We applied our model to two protein structures as examples, and verified the validity of our model using various types of experimental data. We also found that the hot spots in protein binding interfaces have significantly high EVT values, which suggests that they play roles in mediating signal communication between protein domains.     

Detecting phylogenetic signal in mutualistic interaction networks using a Markov process model

Ecological interaction networks, such as those describing the mutualistic interactions between plants and their pollinators or between plants and their frugivores, exhibit non‐random structural properties that cannot be explained by simple models of network formation. One factor affecting the formation and eventual structure of such a network is its evolutionary history. We argue that this, in many cases, is closely linked to the evolutionary histories of the species involved in the interactions. Indeed, empirical studies of interaction networks along with the phylogenies of the interacting species have demonstrated significant associations between phylogeny and network structure. To date, however, no generative model explaining the way in which the evolution of individual species affects the evolution of interaction networks has been proposed. We present a model describing the evolution of pairwise interactions as a branching Markov process, drawing on phylogenetic models of molecular evolution. Using knowledge of the phylogenies of the interacting species, our model yielded a significantly better fit to 21% of a set of plant–pollinator and plant–frugivore mutualistic networks. This highlights the importance, in a substantial minority of cases, of inheritance of interaction patterns without excluding the potential role of ecological novelties in forming the current network architecture. We suggest that our model can be used as a null model for controlling evolutionary signals when evaluating the role of other factors in shaping the emergence of ecological networks.     

Non-neutral community dynamics: empirical predictions for ecosystem function and diversity from linearized consumer–resource interactions

A general model of linearized species interactions, essentially Lotka–Volterra theory, applied to questions of biodiversity has previously been shown to be a powerful tool for understanding local species–abundance patterns and community responses to environmental change for a single trophic level. Here this approach is extended to predict community composition and responses to environmental changes in trophically structured systems. We show how resource and consumer species richness and their relative abundances vary with the means and variances in enrichment level and strengths of intra- and interspecific interactions. Also demonstrated are the responses of local resource and consumer species richness to the global species pools at both trophic levels, as well as the covariation with net resource productivity. These predictions for resource and consumer specific responses to changes in environmental enrichment and global biodiversity are directly testable.     

A unified framework for inferring the multi-scale organization of chromatin domains from Hi-C

Chromosomes are giant chain molecules organized into an ensemble of three-dimensional structures characterized with its genomic state and the corresponding biological functions. Despite the strong cell-to-cell heterogeneity, the cell-type specific pattern demonstrated in high-throughput chromosome conformation capture (Hi-C) data hints at a valuable link between structure and function, which makes inference of chromatin domains (CDs) from the pattern of Hi-C a central problem in genome research. Here we present a unified method for analyzing Hi-C data to determine spatial organization of CDs over multiple genomic scales. By applying statistical physics-based clustering analysis to a polymer physics model of the chromosome, our method identifies the CDs that best represent the global pattern of correlation manifested in Hi-C. The multi-scale intra-chromosomal structures compared across different cell types uncover the principles underlying the multi-scale organization of chromatin chain: (i) Sub-TADs, TADs, and meta-TADs constitute a robust hierarchical structure. (ii) The assemblies of compartments and TAD-based domains are governed by different organizational principles. (iii) Sub-TADs are the common building blocks of chromosome architecture. Our physically principled interpretation and analysis of Hi-C not only offer an accurate and quantitative view of multi-scale chromatin organization but also help decipher its connections with genome function.     

SIMPLE: a simplifying-ensembling framework for parallel community detection from large networks

Community detection is a classic and very difficult task in complex network analysis. As the increasingly explosion of social media, scaling community detection methods to large networks has attracted considerable recent interests. In this paper, we propose a novel SIMPLifying and Ensembling (SIMPLE) framework for parallel community detection. It employs the random link sampling to simplify the network and obtain basic partitionings on every sampled graphs. Then, the K-means-based Consensus Clustering is used to ensemble a number of basic partitionings to get high-quality community structures. All of phases in SIMPLE, including random sampling, sampled graph partitioning, and consensus clustering, are encapsulated into MapReduce for parallel execution. Experiments on six real-world social networks analyze key parameters and factors inside SIMPLE, and demonstrate both effectiveness and efficiency of the SIMPLE.     

A computational framework for the topological analysis and targeted disruption of signal transduction networks

In this article, optimization-based frameworks are introduced for elucidating the input-output structure of signaling networks and for pinpointing targeted disruptions leading to the silencing of undesirable outputs in therapeutic interventions. The frameworks are demonstrated on a large-scale reconstruction of a signaling network composed of nine signaling pathways implicated in prostate cancer. The Min-Input framework is used to exhaustively identify all input-output connections implied by the signaling network structure. Results reveal that there exist two distinct types of outputs in the signaling network that either can be elicited by many different input combinations or are highly specific requiring dedicated inputs. The Min-Interference framework is next used to precisely pinpoint key disruptions that negate undesirable outputs while leaving unaffected necessary ones. In addition to identifying disruptions of terminal steps, we also identify complex disruption combinations in upstream pathways that indirectly negate the targeted output by propagating their action through the signaling cascades. By comparing the obtained disruption targets with lists of drug molecules we find that many of these targets can be acted upon by existing drug compounds, whereas the remaining ones point at so-far unexplored targets. Overall the proposed computational frameworks can help elucidate input/output relationships of signaling networks and help to guide the systematic design of interference strategies.     

Population networks: a large-scale framework for modelling cortical neural networks

Artificial neural networks are usually built on rather few elements such as activation functions, learning rules, and the network topology. When modelling the more complex properties of realistic networks, however, a number of higher-level structural principles become important. In this paper we present a theoretical framework for modelling cortical networks at a high level of abstraction. Based on the notion of a population of neurons, this framework can accommodate the common features of cortical architecture, such as lamination, multiple areas and topographic maps, input segregation, and local variations of the frequency of different cell types (e.g., cytochrome oxidase blobs). The framework is meant primarily for the simulation of activation dynamics; it can also be used to model the neural environment of single cells in a multiscale approach. Received: 9 January 1996 / Accepted in revised form: 24 July 1996     

Transmembrane topology and signal peptide prediction using dynamic bayesian networks

Hidden Markov models (HMMs) have been successfully applied to the tasks of transmembrane protein topology prediction and signal peptide prediction. In this paper we expand upon this work by making use of the more powerful class of dynamic Bayesian networks (DBNs). Our model, Philius, is inspired by a previously published HMM, Phobius, and combines a signal peptide submodel with a transmembrane submodel. We introduce a two-stage DBN decoder that combines the power of posterior decoding with the grammar constraints of Viterbi-style decoding. Philius also provides protein type, segment, and topology confidence metrics to aid in the interpretation of the predictions. We report a relative improvement of 13% over Phobius in full-topology prediction accuracy on transmembrane proteins, and a sensitivity and specificity of 0.96 in detecting signal peptides. We also show that our confidence metrics correlate well with the observed precision. In addition, we have made predictions on all 6.3 million proteins in the Yeast Resource Center (YRC) database. This large-scale study provides an overall picture of the relative numbers of proteins that include a signal-peptide and/or one or more transmembrane segments as well as a valuable resource for the scientific community. All DBNs are implemented using the Graphical Models Toolkit. Source code for the models described here is available at http://noble.gs.washington.edu/proj/philius. A Philius Web server is available at http://www.yeastrc.org/philius, and the predictions on the YRC database are available at http://www.yeastrc.org/pdr.     

A mechanistic framework for a priori pharmacokinetic predictions of orally inhaled drugs

The fate of orally inhaled drugs is determined by pulmonary pharmacokinetic processes such as particle deposition, pulmonary drug dissolution, and mucociliary clearance. Even though each single process has been systematically investigated, a quantitative understanding on the interaction of processes remains limited and therefore identifying optimal drug and formulation characteristics for orally inhaled drugs is still challenging. To investigate this complex interplay, the pulmonary processes can be integrated into mathematical models. However, existing modeling attempts considerably simplify these processes or are not systematically evaluated against (clinical) data. In this work, we developed a mathematical framework based on physiologically-structured population equations to integrate all relevant pulmonary processes mechanistically. A tailored numerical resolution strategy was chosen and the mechanistic model was evaluated systematically against data from different clinical studies. Without adapting the mechanistic model or estimating kinetic parameters based on individual study data, the developed model was able to predict simultaneously (i) lung retention profiles of inhaled insoluble particles, (ii) particle size-dependent pharmacokinetics of inhaled monodisperse particles, (iii) pharmacokinetic differences between inhaled fluticasone propionate and budesonide, as well as (iv) pharmacokinetic differences between healthy volunteers and asthmatic patients. Finally, to identify the most impactful optimization criteria for orally inhaled drugs, the developed mechanistic model was applied to investigate the impact of input parameters on both the pulmonary and systemic exposure. Interestingly, the solubility of the inhaled drug did not have any relevant impact on the local and systemic pharmacokinetics. Instead, the pulmonary dissolution rate, the particle size, the tissue affinity, and the systemic clearance were the most impactful potential optimization parameters. In the future, the developed prediction framework should be considered a powerful tool for identifying optimal drug and formulation characteristics.     

MUSIC: identification of enriched regions in ChIP-Seq experiments using a mappability-corrected multiscale signal processing framework

We present MUSIC, a signal processing approach for identification of enriched regions in ChIP-Seq data, available at music.gersteinlab.org. MUSIC first filters the ChIP-Seq read-depth signal for systematic noise from non-uniform mappability, which fragments enriched regions. Then it performs a multiscale decomposition, using median filtering, identifying enriched regions at multiple length scales. This is useful given the wide range of scales probed in ChIP-Seq assays. MUSIC performs favorably in terms of accuracy and reproducibility compared with other methods. In particular, analysis of RNA polymerase II data reveals a clear distinction between the stalled and elongating forms of the polymerase.

Electronic supplementary material

The online version of this article (doi:10.1186/s13059-014-0474-3) contains supplementary material, which is available to authorized users.     

Information theory provides a comprehensive framework for the evaluation of protein structure predictions

Protein structure prediction has a number of important ad hoc similarity measures for evaluating predictions, but would benefit from a measure that is able to provide a common framework for a broad range of comparisons. Here we show that a mutual information-like measure can provide a comprehensive framework for evaluating protein structure prediction of all types. We discuss the concept of information, its application to secondary structure, and the obstacle to applying it to 3D structure. On the basis of the insights from the secondary structure case, we present an approach to work around the 3D difficulties, and develop a method to measure the mutual information provided by a 3D structure prediction. We integrate the evaluation of all types of protein structure prediction into a single framework, and compare the amount of information provided by various prediction methods, including secondary structure prediction. Within this broadened framework, the idea that structure is better preserved than sequence during evolution is evaluated quantitatively for the globin family. A nearly perfect sequence match in the globin family corresponds to about 300 bits of information, whereas a nearly perfect structural match for the same two proteins corresponds to about 2500 bits of information, where bits of information describes the probability of obtaining a match of similar closeness by chance. Mutual information provides both a theoretical basis for evaluating structure similarity and an explanatory surround for existing similarity measures.     

Linking macroecology and community ecology: refining predictions of species distributions using biotic interaction networks

Macroecological models for predicting species distributions usually only include abiotic environmental conditions as explanatory variables, despite knowledge from community ecology that all species are linked to other species through biotic interactions. This disconnect is largely due to the different spatial scales considered by the two sub‐disciplines: macroecologists study patterns at large extents and coarse resolutions, while community ecologists focus on small extents and fine resolutions. A general framework for including biotic interactions in macroecological models would help bridge this divide, as it would allow for rigorous testing of the role that biotic interactions play in determining species ranges. Here, we present an approach that combines species distribution models with Bayesian networks, which enables the direct and indirect effects of biotic interactions to be modelled as propagating conditional dependencies among species’ presences. We show that including biotic interactions in distribution models for species from a California grassland community results in better range predictions across the western USA. This new approach will be important for improving estimates of species distributions and their dynamics under environmental change.     

Searching on patch networks using correlated random walks: space usage and optimal foraging predictions using Markov chain models

We describe a novel representation of a discrete correlated random walk as the transition matrix of a Markov chain with the displacements as the states. Such a representation makes it possible to utilize results from the theory of absorbing Markov chains, to make biologically interesting predictions without having to resort to Monte Carlo simulations. Our motivation for constructing such a representation is to explore the relationship between the movement strategy of an animal searching for resources upon a network of patches, and its consequent utilization of space and foraging success. As an illustrative case study, we have determined the optimal movement strategy and the consequent usage of space for a central place forager utilizing a continuous movement space which is discretized as a hexagonal lattice. The optimal movement strategy determines the size of the optimal home range. In this example, the animal uses mnemokinesis, which is a sinuosity regulating mechanism, to return it to the central place. The movement strategy thus refers to the choice of the intrinsic path sinuosity and the strength of the mnemokinetic mechanism. Although the movement space has been discretized as a regular lattice in this example, the method can be readily applied to naturally compartmentalized movement spaces, such as forest canopy networks. This paper is thus an attempt at incorporating results from the theory of random walk-based animal movements into Foraging Theory.