Drug-target network

The global set of relationships between protein targets of all drugs and all disease-gene products in the human protein-protein interaction or 'interactome' network remains uncharacterized. We built a bipartite graph composed of US Food and Drug Administration-approved drugs and proteins linked by drug-target binary associations. The resulting network connects most drugs into a highly interlinked giant component, with strong local clustering of drugs of similar types according to Anatomical Therapeutic Chemical classification. Topological analyses of this network quantitatively showed an overabundance of 'follow-on' drugs, that is, drugs that target already targeted proteins. By including drugs currently under investigation, we identified a trend toward more functionally diverse targets improving polypharmacology. To analyze the relationships between drug targets and disease-gene products, we measured the shortest distance between both sets of proteins in current models of the human interactome network. Significant differences in distance were found between etiological and palliative drugs. A recent trend toward more rational drug design was observed.     

Two-neurons network

The behavior of two pacemakers simulated by integrate and fire oscillators reciprocally connected by synapses is studied. The activation of each synapse produces a sudden potential shift in the post-synaptic neuron. Two sorts of behaviour may occur when at least one synapse is excitatory. Phase-locking occurs for almost every set of parameters, and given certain initial conditions. Repetitive patterns in indifferent equilibrium appear in the presence of a given set of parameters and certain other initial conditions. Quasi-periodic behaviour corresponds to almost every set of parameters when both synapses are inhibitory, although repetitive patterns of firing in indifferent equilibrium occassionally occur.     

Mean-field Boolean network model of a signal transduction network

In this paper we provide a mean-field Boolean network model for a signal transduction network of a generic fibroblast cell. The network consists of several main signaling pathways, including the receptor tyrosine kinase, the G-protein coupled receptor, and the Integrin signaling pathway. The network consists of 130 nodes, each representing a signaling molecule (mainly proteins). Nodes are governed by Boolean dynamics including canalizing functions as well as totalistic Boolean functions that depend only on the overall fraction of active nodes. We categorize the Boolean functions into several different classes. Using a mean-field approach we generate a mathematical formula for the probability of a node becoming active at any time step. The model is shown to be a good match for the actual network. This is done by iterating both the actual network and the model and comparing the results numerically. Using the Boolean model it is shown that the system is stable under a variety of parameter combinations. It is also shown that this model is suitable for assessing the dynamics of the network under protein mutations. Analytical results support the numerical observations that in the long-run at most half of the nodes of the network are active.     

Metabolic network alignment in large scale by network compression

Metabolic network alignment is a system scale comparative analysis that discovers important similarities and differences across different metabolisms and organisms. Although the problem of aligning metabolic networks has been considered in the past, the computational complexity of the existing solutions has so far limited their use to moderately sized networks. In this paper, we address the problem of aligning two metabolic networks, particularly when both of them are too large to be dealt with using existing methods. We develop a generic framework that can significantly improve the scale of the networks that can be aligned in practical time. Our framework has three major phases, namely the compression phase, the alignment phase and the refinement phase. For the first phase, we develop an algorithm which transforms the given networks to a compressed domain where they are summarized using fewer nodes, termed supernodes, and interactions. In the second phase, we carry out the alignment in the compressed domain using an existing network alignment method as our base algorithm. This alignment results in supernode mappings in the compressed domain, each of which are smaller instances of network alignment problem. In the third phase, we solve each of the instances using the base alignment algorithm to refine the alignment results. We provide a user defined parameter to control the number of compression levels which generally determines the tradeoff between the quality of the alignment versus how fast the algorithm runs. Our experiments on the networks from KEGG pathway database demonstrate that the compression method we propose reduces the sizes of metabolic networks by almost half at each compression level which provides an expected speedup of more than an order of magnitude. We also observe that the alignments obtained by only one level of compression capture the original alignment results with high accuracy. Together, these suggest that our framework results in alignments that are comparable to existing algorithms and can do this with practical resource utilization for large scale networks that existing algorithms could not handle. As an example of our method's performance in practice, the alignment of organism-wide metabolic networks of human (1615 reactions) and mouse (1600 reactions) was performed under three minutes by only using a single level of compression.     

Extraction of phylogenetic network modules from the metabolic network

Background  

In bio-systems, genes, proteins and compounds are related to each other, thus forming complex networks. Although each organism has its individual network, some organisms contain common sub-networks based on function. Given a certain sub-network, the distribution of organisms common to it represents the diversity of its function.     

Comparative network stratification analysis for identifying functional interpretable network biomarkers

Background

A major challenge of bioinformatics in the era of precision medicine is to identify the molecular biomarkers for complex diseases. It is a general expectation that these biomarkers or signatures have not only strong discrimination ability, but also readable interpretations in a biological sense. Generally, the conventional expression-based or network-based methods mainly capture differential genes or differential networks as biomarkers, however, such biomarkers only focus on phenotypic discrimination and usually have less biological or functional interpretation. Meanwhile, the conventional function-based methods could consider the biomarkers corresponding to certain biological functions or pathways, but ignore the differential information of genes, i.e., disregard the active degree of particular genes involved in particular functions, thereby resulting in less discriminative ability on phenotypes. Hence, it is strongly demanded to develop elaborate computational methods to directly identify functional network biomarkers with both discriminative power on disease states and readable interpretation on biological functions.

Results

In this paper, we present a new computational framework based on an integer programming model, named as Comparative Network Stratification (CNS), to extract functional or interpretable network biomarkers, which are of strongly discriminative power on disease states and also readable interpretation on biological functions. In addition, CNS can not only recognize the pathogen biological functions disregarded by traditional Expression-based/Network-based methods, but also uncover the active network-structures underlying such dysregulated functions underestimated by traditional Function-based methods. To validate the effectiveness, we have compared CNS with five state-of-the-art methods, i.e. GSVA, Pathifier, stSVM, frSVM and AEP on four datasets of different complex diseases. The results show that CNS can enhance the discriminative power of network biomarkers, and further provide biologically interpretable information or disease pathogenic mechanism of these biomarkers. A case study on type 1 diabetes (T1D) demonstrates that CNS can identify many dysfunctional genes and networks previously disregarded by conventional approaches.

Conclusion

Therefore, CNS is actually a powerful bioinformatics tool, which can identify functional or interpretable network biomarkers with both discriminative power on disease states and readable interpretation on biological functions. CNS was implemented as a Matlab package, which is available at http://www.sysbio.ac.cn/cb/chenlab/images/CNSpackage_0.1.rar.

     

Influence of network topology on mechanical properties of network polymers

We studied theoretically how the network topology influences the mechanical properties of polymers. We used conclusions of thermofluctuation theory of fracture and graph theory. The long-term strengths of monofunctional and polyfunctional networks were compared. The cross-link functionality distribution of the polyfunctional networks is a power function. All other conditions being equal, the long-term strengths of the polyfunctional polymer networks are some three to four times the long-term strengths of the monofunctional networks.     

The EH network

The EH domain is an evolutionary conserved protein-protein interaction domain present in a growing number of proteins from yeast to mammals. Even though the domain was discovered just 5 years ago, a great deal has been learned regarding its three-dimensional structure and binding specificities. Moreover, a number of cellular ligands of the domain have been identified and demonstrated to define a complex network of protein-protein interactions in the eukaryotic cell. Interestingly, many of the EH-containing and EH-binding proteins display characteristics of endocytic "accessory" proteins, suggesting that the principal function of the EH network is to regulate various steps in endocytosis. In addition, recent evidence suggests that the EH network might work as an "integrator" of signals controlling cellular pathways as diverse as endocytosis, nucleocytosolic export, and ultimately cell proliferation.     

Inferring general relations between network characteristics from specific network ensembles

Different network models have been suggested for the topology underlying complex interactions in natural systems. These models are aimed at replicating specific statistical features encountered in real-world networks. However, it is rarely considered to which degree the results obtained for one particular network class can be extrapolated to real-world networks. We address this issue by comparing different classical and more recently developed network models with respect to their ability to generate networks with large structural variability. In particular, we consider the statistical constraints which the respective construction scheme imposes on the generated networks. After having identified the most variable networks, we address the issue of which constraints are common to all network classes and are thus suitable candidates for being generic statistical laws of complex networks. In fact, we find that generic, not model-related dependencies between different network characteristics do exist. This makes it possible to infer global features from local ones using regression models trained on networks with high generalization power. Our results confirm and extend previous findings regarding the synchronization properties of neural networks. Our method seems especially relevant for large networks, which are difficult to map completely, like the neural networks in the brain. The structure of such large networks cannot be fully sampled with the present technology. Our approach provides a method to estimate global properties of under-sampled networks in good approximation. Finally, we demonstrate on three different data sets (C. elegans neuronal network, R. prowazekii metabolic network, and a network of synonyms extracted from Roget's Thesaurus) that real-world networks have statistical relations compatible with those obtained using regression models.     

Differential network biology

Protein and genetic interaction maps can reveal the overall physical and functional landscape of a biological system. To date, these interaction maps have typically been generated under a single condition, even though biological systems undergo differential change that is dependent on environment, tissue type, disease state, development or speciation. Several recent interaction mapping studies have demonstrated the power of differential analysis for elucidating fundamental biological responses, revealing that the architecture of an interactome can be massively re‐wired during a cellular or adaptive response. Here, we review the technological developments and experimental designs that have enabled differential network mapping at very large scales and highlight biological insight that has been derived from this type of analysis. We argue that differential network mapping, which allows for the interrogation of previously unexplored interaction spaces, will become a standard mode of network analysis in the future, just as differential gene expression and protein phosphorylation studies are already pervasive in genomic and proteomic analysis.     

Grand network convergence

A report of the Systems Biology: Networks meeting, Cold Spring Harbor, USA, 22-26 March 2011.     

Dynamic properties of network motifs contribute to biological network organization

Biological networks, such as those describing gene regulation, signal transduction, and neural synapses, are representations of large-scale dynamic systems. Discovery of organizing principles of biological networks can be enhanced by embracing the notion that there is a deep interplay between network structure and system dynamics. Recently, many structural characteristics of these non-random networks have been identified, but dynamical implications of the features have not been explored comprehensively. We demonstrate by exhaustive computational analysis that a dynamical property—stability or robustness to small perturbations—is highly correlated with the relative abundance of small subnetworks (network motifs) in several previously determined biological networks. We propose that robust dynamical stability is an influential property that can determine the non-random structure of biological networks.     

A network synthesis model for generating protein interaction network families

In this work, we introduce a novel network synthesis model that can generate families of evolutionarily related synthetic protein-protein interaction (PPI) networks. Given an ancestral network, the proposed model generates the network family according to a hypothetical phylogenetic tree, where the descendant networks are obtained through duplication and divergence of their ancestors, followed by network growth using network evolution models. We demonstrate that this network synthesis model can effectively create synthetic networks whose internal and cross-network properties closely resemble those of real PPI networks. The proposed model can serve as an effective framework for generating comprehensive benchmark datasets that can be used for reliable performance assessment of comparative network analysis algorithms. Using this model, we constructed a large-scale network alignment benchmark, called NAPAbench, and evaluated the performance of several representative network alignment algorithms. Our analysis clearly shows the relative performance of the leading network algorithms, with their respective advantages and disadvantages. The algorithm and source code of the network synthesis model and the network alignment benchmark NAPAbench are publicly available at http://www.ece.tamu.edu/bjyoon/NAPAbench/.     

The lipid network

Natural cell membranes are composed of a remarkable variety of lipids, which provide specific biophysical properties to support membrane protein function. An improved understanding of this complexity of membrane composition may also allow the design of membrane active drugs. Crafting a relevant model of a cell membrane with controlled composition is becoming an art, with the ability to reveal the molecular mechanisms of biological processes and lead to better treatment of pathologies. By matching physiological observations from in vivo experiments to high-resolution information, more easily obtained from in vitro studies, complex interactions at the lipid interface are determined. The role of the lipid network in biological membranes is, therefore, the subject of increasing attention.     

The time-into-intensity-mapping network

We employ a special combination of different networks in order to process (transient) spatiotemporal patterns. In a first layer, feature analyzing cells translate instantaneous spatial patterns into activities of cells symbolizing the presence of certain feature values. A second layer maps the time sequence of symbols into a spatial activity pattern of the so-called TIM-cells. A third layer recognizes predefined activity patterns. We demonstrate the behaviour of the network using gaussian patterns in (1 + 1) space-time dimensions.