基于信息度量的基因网络建模

基因网络作为生物系统三大网络中最基础的组成部分,是目前系统生物学研究的一大热点。本文分析了目前基因网络。建模的各种方法。井着重分析了布尔网络的建模特点。提出了利用信息理论中的信息熵和互信息方法来分析基因网络的各元素之间的布尔逻辑关系。通过实例分析说明了该方法在布尔网络建模中的有效性。     

Bioinformatics analysis of protein interaction networks: Statistics, topologies, and meeting the standards of experimental biologists

In recent years, bioinformatics analyses of protein networks have allowed researchers to obtain exceptional theoretical predictions and subsequent experimental confirmations. The current view is that protein networks are scale-free networks and have a topology analogous to that of transport networks, the Internet, and social networks. However, an alternative hypothesis exists in which protein networks and scale-free networks possess significantly different properties. In this work, we show that existing information is insufficient to describe protein networks as scale-free networks.     

Scaling of differentiation in networks: nervous systems,organisms, ant colonies,ecosystems, businesses,universities, cities,electronic circuits,and Legos

Nodes in networks are often of different types, and in this sense networks are differentiated. Here we examine the relationship between network differentiation and network size in networks under economic or natural selective pressure, such as electronic circuits (networks of electronic components), Legos (networks of Lego pieces), businesses (networks of employees), universities (networks of faculty), organisms (networks of cells), ant colonies (networks of ants), and nervous systems (networks of neurons). For each of these we find that (i) differentiation increases with network size, and (ii) the relationship is consistent with a power law. These results are explained by a hypothesis that, because nodes are costly to build and maintain in such "selected networks", network size is optimized, and from this the power-law relationship may be derived. The scaling exponent depends on the particular kind of network, and is determined by the degree to which nodes are used in a combinatorial fashion to carry out network-level functions. We find that networks under natural selection (organisms, ant colonies, and nervous systems) have much higher combinatorial abilities than the networks for which human ingenuity is involved (electronic circuits, Legos, businesses, and universities). A distinct but related optimization hypothesis may be used to explain scaling of differentiation in competitive networks (networks where the nodes themselves, rather than the entire network, are under selective pressure) such as ecosystems (networks of organisms).     

Hydrophobic, hydrophilic, and charged amino acid networks within protein

The native three-dimensional structure of a single protein is determined by the physicochemical nature of its constituent amino acids. The 20 different types of amino acids, depending on their physicochemical properties, can be grouped into three major classes: hydrophobic, hydrophilic, and charged. The anatomy of the weighted and unweighted networks of hydrophobic, hydrophilic, and charged residues separately for a large number of proteins were studied. Results showed that the average degree of the hydrophobic networks has a significantly larger value than that of hydrophilic and charged networks. The average degree of the hydrophilic networks is slightly higher than that of the charged networks. The average strength of the nodes of hydrophobic networks is nearly equal to that of the charged network, whereas that of hydrophilic networks has a smaller value than that of hydrophobic and charged networks. The average strength for each of the three types of networks varies with its degree. The average strength of a node in a charged network increases more sharply than that of the hydrophobic and hydrophilic networks. Each of the three types of networks exhibits the "small-world" property. Our results further indicate that the all-amino-acids networks and hydrophobic networks are of assortative type. Although most of the hydrophilic and charged networks are of the assortative type, few others have the characteristics of disassortative mixing of the nodes. We have further observed that all-amino-acids networks and hydrophobic networks bear the signature of hierarchy, whereas the hydrophilic and charged networks do not have any hierarchical signature.     

On Nakhleh's Metric for Reduced Phylogenetic Networks

We prove that Nakhleh's metric for reduced phylogenetic networks is also a metric on the classes of tree-child phylogenetic networks, semibinary tree-sibling time consistent phylogenetic networks, and multilabeled phylogenetic trees. We also prove that it separates distinguishable phylogenetic networks. In this way, it becomes the strongest dissimilarity measure for phylogenetic networks available so far. Furthermore, we propose a generalization of that metric that separates arbitrary phylogenetic networks.     

细胞代谢复杂网络研究进展

复杂网络理论为细胞代谢网络研究提供了新的工具,基于复杂网络理论的细胞代谢网络研究可称细胞代谢复杂网络研究．先简要介绍了细胞代谢复杂网络的研究背景;随后详细总结和论述了细胞代谢复杂网络在建模、分析和控制三个方面的研究现状;再进一步指出了细胞代谢复杂网络在建模、分析和控制这三个方面研究中所存在的一些问题．为细胞代谢复杂网络领域的研究指出了一些有意义的方向,具有一定的参考价值。     

Identification of Important Nodes in Directed Biological Networks: A Network Motif Approach

Identification of important nodes in complex networks has attracted an increasing attention over the last decade. Various measures have been proposed to characterize the importance of nodes in complex networks, such as the degree, betweenness and PageRank. Different measures consider different aspects of complex networks. Although there are numerous results reported on undirected complex networks, few results have been reported on directed biological networks. Based on network motifs and principal component analysis (PCA), this paper aims at introducing a new measure to characterize node importance in directed biological networks. Investigations on five real-world biological networks indicate that the proposed method can robustly identify actually important nodes in different networks, such as finding command interneurons, global regulators and non-hub but evolutionary conserved actually important nodes in biological networks. Receiver Operating Characteristic (ROC) curves for the five networks indicate remarkable prediction accuracy of the proposed measure. The proposed index provides an alternative complex network metric. Potential implications of the related investigations include identifying network control and regulation targets, biological networks modeling and analysis, as well as networked medicine.     

基于组学数据构建基因调控网络

在生命体内,基因以及其它分子间相互作用形成复杂调控网络,生命过程都是以调控网络的形式存在,如从代谢通路网络到转录调控网络,从信号转导网络到蛋白质相互作用网络等等。因此,网络现象是生命现象的复杂本质和主要特征。本文系统地介绍了基于表达谱数据构建基因调控网络的布尔网络模型,线性模型,微分方程模型和贝叶斯网络模型,并对各种网络构建模型进行了深入的分析和总结。同时,文章从基因组序列信息、蛋白质相互作用信息和生物医学文献信息等方面讨论了基因调控网络方面构建的研究,这对从系统生物学水平揭示生命复杂机制具有重要的参考价值。     

Contrasting structures of plant–mite networks compounded by phytophagous and predatory mite species

Differences in the feeding habits between phytophagous and predatory species can determine distinct ecological interactions between mites and their host plants. Herein, plant–mite networks were constructed using available literature on plant-dwelling mites from Brazilian natural vegetation in order to contrast phytophagous and predatory mite networks. The structural patterns of plant–mite networks were described through network specialization (connectance) and modularity. A total of 187 mite species, 65 host plant species and 646 interactions were recorded in 14 plant–mite networks. Phytophagous networks included 96 mite species, 61 host plants and 277 interactions, whereas predatory networks contained 91 mite species, 54 host plants and 369 interactions. No differences in the species richness of mites and host plants were observed between phytophagous and predatory networks. However, plant–mite networks composed of phytophagous mites showed lower connectance and higher modularity when compared to the predatory mite networks. The present results corroborate the hypothesis that trophic networks are more specialized than commensalistic networks, given that the phytophagous species must deal with plant defenses, in contrast to predatory mites which only inhabit and forage for resources on plants.     

Are Nested Networks More Robust to Disturbance? A Test Using Epiphyte-Tree,Comensalistic Networks

Recent research on ecological networks suggests that mutualistic networks are more nested than antagonistic ones and, as a result, they are more robust against chains of extinctions caused by disturbances. We evaluate whether mutualistic networks are more nested than comensalistic and antagonistic networks, and whether highly nested, host-epiphyte comensalistic networks fit the prediction of high robustness against disturbance. A review of 59 networks including mutualistic, antagonistic and comensalistic relationships showed that comensalistic networks are significantly more nested than antagonistic and mutualistic networks, which did not differ between themselves. Epiphyte-host networks from old-growth forests differed from those from disturbed forest in several topological parameters based on both qualitative and quantitative matrices. Network robustness increased with network size, but the slope of this relationship varied with nestedness and connectance. Our results indicate that interaction networks show complex responses to disturbances, which influence their topology and indirectly affect their robustness against species extinctions.     

The abundance effect on network nestedness is stronger for parasitic than herbivory interactions

多度对寄生型网络嵌套结构的影响大于食草型网络 因为物种多度显著影响种间互作频率,分析食物网结构对物种多样性和稳定性影响时,应基于能够反映物种真实偏好的网络(即偏好网),而不是直接观察得到的网络(即观察网)。食草网络中(植物为低营养级)的植物资源多度大于寄生网络中(动物为低营养级)寄主资源多度,因此我们假设：寄生网络的结构比食草网络的结构更易受到多度效应的影响。为验证这一假设,我们从已发表的文献中收集了80 个定量观察网络(包括34个植物-食草昆虫网络和46个寄生网络),应用有效多度模型去除物种多度对观察网络的影响,从而得出偏好网络。然后,我们应用weighted NODF和spectral radius两个嵌套系数表征网络嵌套性,分析了观察网和偏好网的物种链接数分布、相互作用均匀度、加权连通度和稳健性的差异。结果表明,在偏好网中,寄生网络的嵌套程度要低于食草网络,这可能是因为去除多度影响增加了种间作用频率的均匀度。偏好网的加权连通度和稳健性显著高于相应的观察网,表明偏好网比观察网具有更高的网络稳定性。未来的食物网研究不仅应关注互惠和拮抗网络的结构差异,还应该关注食草和寄生等不同类型拮抗食物网的结构差异。     

Structure-based protein-protein interaction networks and drug design

Proteins carry out their functions by interacting with other proteins and small molecules, forming a complex interaction network. In this review, we briefly introduce classical graph theory based protein-protein interaction networks. We also describe the commonly used experimental methods to construct these networks, and the insights that can be gained from these networks. We then discuss the recent transition from graph theory based networks to structure based protein-protein interaction networks and the advantages of the latter over the former, using two networks as examples. We further discuss the usefulness of structure based protein-protein interaction networks for drug discovery, with a special emphasis on drug repositioning.     

Estimating gene regulatory networks and protein-protein interactions of Saccharomyces cerevisiae from multiple genome-wide data

MOTIVATION: Biological processes in cells are properly performed by gene regulations, signal transductions and interactions between proteins. To understand such molecular networks, we propose a statistical method to estimate gene regulatory networks and protein-protein interaction networks simultaneously from DNA microarray data, protein-protein interaction data and other genome-wide data. RESULTS: We unify Bayesian networks and Markov networks for estimating gene regulatory networks and protein-protein interaction networks according to the reliability of each biological information source. Through the simultaneous construction of gene regulatory networks and protein-protein interaction networks of Saccharomyces cerevisiae cell cycle, we predict the role of several genes whose functions are currently unknown. By using our probabilistic model, we can detect false positives of high-throughput data, such as yeast two-hybrid data. In a genome-wide experiment, we find possible gene regulatory relationships and protein-protein interactions between large protein complexes that underlie complex regulatory mechanisms of biological processes.     

Identification of genetic networks

In this report, we propose the use of structural equations as a tool for identifying and modeling genetic networks and genetic algorithms for searching the most likely genetic networks that best fit the data. After genetic networks are identified, it is fundamental to identify those networks influencing cell phenotypes. To accomplish this task we extend the concept of differential expression of the genes, widely used in gene expression data analysis, to genetic networks. We propose a definition for the differential expression of a genetic network and use the generalized T2 statistic to measure the ability of genetic networks to distinguish different phenotypes. However, describing the differential expression of genetic networks is not enough for understanding biological systems because differences in the expression of genetic networks do not directly reflect regulatory strength between gene activities. Therefore, in this report we also introduce the concept of differentially regulated genetic networks, which has the potential to assess changes of gene regulation in response to perturbation in the environment and may provide new insights into the mechanism of diseases and biological processes. We propose five novel statistics to measure the differences in regulation of genetic networks. To illustrate the concepts and methods for reconstruction of genetic networks and identification of association of genetic networks with function, we applied the proposed models and algorithms to three data sets.     

The relative efficiency of modular and non-modular networks of different size

Most biological networks are modular but previous work with small model networks has indicated that modularity does not necessarily lead to increased functional efficiency. Most biological networks are large, however, and here we examine the relative functional efficiency of modular and non-modular neural networks at a range of sizes. We conduct a detailed analysis of efficiency in networks of two size classes: ‘small’ and ‘large’, and a less detailed analysis across a range of network sizes. The former analysis reveals that while the modular network is less efficient than one of the two non-modular networks considered when networks are small, it is usually equally or more efficient than both non-modular networks when networks are large. The latter analysis shows that in networks of small to intermediate size, modular networks are much more efficient that non-modular networks of the same (low) connective density. If connective density must be kept low to reduce energy needs for example, this could promote modularity. We have shown how relative functionality/performance scales with network size, but the precise nature of evolutionary relationship between network size and prevalence of modularity will depend on the costs of connectivity.     

Influence of Choice of Null Network on Small-World Parameters of Structural Correlation Networks

In recent years, coordinated variations in brain morphology (e.g., volume, thickness) have been employed as a measure of structural association between brain regions to infer large-scale structural correlation networks. Recent evidence suggests that brain networks constructed in this manner are inherently more clustered than random networks of the same size and degree. Thus, null networks constructed by randomizing topology are not a good choice for benchmarking small-world parameters of these networks. In the present report, we investigated the influence of choice of null networks on small-world parameters of gray matter correlation networks in healthy individuals and survivors of acute lymphoblastic leukemia. Three types of null networks were studied: 1) networks constructed by topology randomization (TOP), 2) networks matched to the distributional properties of the observed covariance matrix (HQS), and 3) networks generated from correlation of randomized input data (COR). The results revealed that the choice of null network not only influences the estimated small-world parameters, it also influences the results of between-group differences in small-world parameters. In addition, at higher network densities, the choice of null network influences the direction of group differences in network measures. Our data suggest that the choice of null network is quite crucial for interpretation of group differences in small-world parameters of structural correlation networks. We argue that none of the available null models is perfect for estimation of small-world parameters for correlation networks and the relative strengths and weaknesses of the selected model should be carefully considered with respect to obtained network measures.     

Usefulness and limitations of dK random graph models to predict interactions and functional homogeneity in biological networks under a pseudo-likelihood parameter estimation approach

Background  

Many aspects of biological functions can be modeled by biological networks, such as protein interaction networks, metabolic networks, and gene coexpression networks. Studying the statistical properties of these networks in turn allows us to infer biological function. Complex statistical network models can potentially more accurately describe the networks, but it is not clear whether such complex models are better suited to find biologically meaningful subnetworks.     

An interaction switch predicts the nested architecture of mutualistic networks

Nested architecture is distinctive in plant-animal mutualistic networks. However, to date an integrative and quantitative explanation has been lacking. It is evident that species often switch their interactive partners in real-world mutualistic networks such as pollination and seed-dispersal networks. By incorporating an interaction switch into a novel multi-population model, we show that the nested architecture rapidly emerges from an initially random network. The model allowing interaction switches between partner species produced predictions which fit remarkably well with observations from 81 empirical networks. Thus, the nested architecture in mutualistic networks could be an intrinsic physical structure of dynamic networks and the interaction switch is likely a key ecological process that results in nestedness of real-world networks. Identifying the biological processes responsible for network structures is thus crucial for understanding the architecture of ecological networks.