首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 27 毫秒
1.
Detecting protein complexes from protein interaction networks is one major task in the postgenome era. Previous developed computational algorithms identifying complexes mainly focus on graph partition or dense region finding. Most of these traditional algorithms cannot discover overlapping complexes which really exist in the protein-protein interaction (PPI) networks. Even if some density-based methods have been developed to identify overlapping complexes, they are not able to discover complexes that include peripheral proteins. In this study, motivated by recent successful application of generative network model to describe the generation process of PPI networks and to detect communities from social networks, we develop a regularized sparse generative network model (RSGNM), by adding another process that generates propensities using exponential distribution and incorporating Laplacian regularizer into an existing generative network model, for protein complexes identification. By assuming that the propensities are generated using exponential distribution, the estimators of propensities will be sparse, which not only has good biological interpretation but also helps to control the overlapping rate among detected complexes. And the Laplacian regularizer will lead to the estimators of propensities more smooth on interaction networks. Experimental results on three yeast PPI networks show that RSGNM outperforms six previous competing algorithms in terms of the quality of detected complexes. In addition, RSGNM is able to detect overlapping complexes and complexes including peripheral proteins simultaneously. These results give new insights about the importance of generative network models in protein complexes identification.  相似文献   

2.
Takemoto K  Borjigin S 《PloS one》2011,6(10):e25874
Network modularity is an important structural feature in metabolic networks. A previous study suggested that the variability in natural habitat promotes metabolic network modularity in bacteria. However, since many factors influence the structure of the metabolic network, this phenomenon might be limited and there may be other explanations for the change in metabolic network modularity. Therefore, we focus on archaea because they belong to another domain of prokaryotes and show variability in growth conditions (e.g., trophic requirement and optimal growth temperature), but not in habitats because of their specialized growth conditions (e.g., high growth temperature). The relationship between biological features and metabolic network modularity is examined in detail. We first show the absence of a relationship between network modularity and habitat variability in archaea, as archaeal habitats are more limited than bacterial habitats. Although this finding implies the need for further studies regarding the differences in network modularity, it does not contradict previous work. Further investigations reveal alternative explanations. Specifically, growth conditions, trophic requirement, and optimal growth temperature, in particular, affect metabolic network modularity. We have discussed the mechanisms for the growth condition-dependant changes in network modularity. Our findings suggest different explanations for the changes in network modularity and provide new insights into adaptation and evolution in metabolic networks, despite several limitations of data analysis.  相似文献   

3.
Rahat O  Yitzhaky A  Schreiber G 《Proteins》2008,71(2):621-630
Protein-protein interactions networks has come to be a buzzword associated with nets containing edges that represent a pair of interacting proteins (e.g. hormone-receptor, enzyme-inhibitor, antigen-antibody, and a subset of multichain biological machines). Yet, each such interaction composes its own unique network, in which vertices represent amino acid residues, and edges represent atomic contacts. Recent studies have shown that analyses of the data encapsulated in these detailed networks may impact predictions of structure-function correlation. Here, we study homologous families of protein-protein interfaces, which share the same fold but vary in sequence. In this context, we address what properties of the network are shared among relatives with different sequences (and hence different atomic interactions) and which are not. Herein, we develop the general mathematical framework needed to compare the modularity of homologous networks. We then apply this analysis to the structural data of a few interface families, including hemoglobin alpha-beta, growth hormone-receptor, and Serine protease-inhibitor. Our results suggest that interface modularity is an evolutionarily conserved property. Hence, protein-protein interfaces can be clustered down to a few modules, with the boundaries being evolutionarily conserved along homologous complexes. This suggests that protein engineering of protein-protein binding sites may be simplified by varying each module, but retaining the overall modularity of the interface.  相似文献   

4.
MOTIVATION: A promising and reliable approach to annotate gene function is clustering genes not only by using gene expression data but also literature information, especially gene networks. RESULTS: We present a systematic method for gene clustering by combining these totally different two types of data, particularly focusing on network modularity, a global feature of gene networks. Our method is based on learning a probabilistic model, which we call a hidden modular random field in which the relation between hidden variables directly represents a given gene network. Our learning algorithm which minimizes an energy function considering the network modularity is practically time-efficient, regardless of using the global network property. We evaluated our method by using a metabolic network and microarray expression data, changing with microarray datasets, parameters of our model and gold standard clusters. Experimental results showed that our method outperformed other four competing methods, including k-means and existing graph partitioning methods, being statistically significant in all cases. Further detailed analysis showed that our method could group a set of genes into a cluster which corresponds to the folate metabolic pathway while other methods could not. From these results, we can say that our method is highly effective for gene clustering and annotating gene function.  相似文献   

5.
Functional topology in a network of protein interactions   总被引:8,自引:0,他引:8  
MOTIVATION: The building blocks of biological networks are individual protein-protein interactions (PPIs). The cumulative PPI data set in Saccharomyces cerevisiae now exceeds 78 000. Studying the network of these interactions will provide valuable insight into the inner workings of cells. RESULTS: We performed a systematic graph theory-based analysis of this PPI network to construct computational models for describing and predicting the properties of lethal mutations and proteins participating in genetic interactions, functional groups, protein complexes and signaling pathways. Our analysis suggests that lethal mutations are not only highly connected within the network, but they also satisfy an additional property: their removal causes a disruption in network structure. We also provide evidence for the existence of alternate paths that bypass viable proteins in PPI networks, while such paths do not exist for lethal mutations. In addition, we show that distinct functional classes of proteins have differing network properties. We also demonstrate a way to extract and iteratively predict protein complexes and signaling pathways. We evaluate the power of predictions by comparing them with a random model, and assess accuracy of predictions by analyzing their overlap with MIPS database. CONCLUSIONS: Our models provide a means for understanding the complex wiring underlying cellular function, and enable us to predict essentiality, genetic interaction, function, protein complexes and cellular pathways. This analysis uncovers structure-function relationships observable in a large PPI network.  相似文献   

6.
Protein interaction networks are known to exhibit remarkable structures: scale-free and small-world and modular structures. To explain the evolutionary processes of protein interaction networks possessing scale-free and small-world structures, preferential attachment and duplication-divergence models have been proposed as mathematical models. Protein interaction networks are also known to exhibit another remarkable structural characteristic, modular structure. How the protein interaction networks became to exhibit modularity in their evolution? Here, we propose a hypothesis of modularity in the evolution of yeast protein interaction network based on molecular evolutionary evidence. We assigned yeast proteins into six evolutionary ages by constructing a phylogenetic profile. We found that all the almost half of hub proteins are evolutionarily new. Examining the evolutionary processes of protein complexes, functional modules and topological modules, we also found that member proteins of these modules tend to appear in one or two evolutionary ages. Moreover, proteins in protein complexes and topological modules show significantly low evolutionary rates than those not in these modules. Our results suggest a hypothesis of modularity in the evolution of yeast protein interaction network as systems evolution.  相似文献   

7.
Social networks can be organized into communities of closely connected nodes, a property known as modularity. Because diseases, information, and behaviors spread faster within communities than between communities, understanding modularity has broad implications for public policy, epidemiology and the social sciences. Explanations for community formation in social networks often incorporate the attributes of individual people, such as gender, ethnicity or shared activities. High modularity is also a property of large-scale social networks, where each node represents a population of individuals at a location, such as call flow between mobile phone towers. However, whether or not place-based attributes, including land cover and economic activity, can predict community membership for network nodes in large-scale networks remains unknown. We describe the pattern of modularity in a mobile phone communication network in the Dominican Republic, and use a linear discriminant analysis (LDA) to determine whether geographic context can explain community membership. Our results demonstrate that place-based attributes, including sugar cane production, urbanization, distance to the nearest airport, and wealth, correctly predicted community membership for over 70% of mobile phone towers. We observed a strongly positive correlation (r = 0.97) between the modularity score and the predictive ability of the LDA, suggesting that place-based attributes can accurately represent the processes driving modularity. In the absence of social network data, the methods we present can be used to predict community membership over large scales using solely place-based attributes.  相似文献   

8.
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.  相似文献   

9.
Financial networks have been extensively studied as examples of real world complex networks. In this paper, we establish and study the network of venture capital (VC) firms in China. We compute and analyze the statistical properties of the network, including parameters such as degrees, mean lengths of the shortest paths, clustering coefficient and robustness. We further study the topology of the network and find that it has small-world behavior. A multiple linear regression model is introduced to study the relation between network parameters and major regional economic indices in China. From the result of regression, we find that, economic aggregate (including the total GDP, investment, consumption and net export), upgrade of industrial structure, employment and remuneration of a region are all positively correlated with the degree and the clustering coefficient of the VC sub-network of the region, which suggests that the development of the VC industry has substantial effects on regional economy in China.  相似文献   

10.
Biological networks have evolved to be highly functional within uncertain environments while remaining extremely adaptable. One of the main contributors to the robustness and evolvability of biological networks is believed to be their modularity of function, with modules defined as sets of genes that are strongly interconnected but whose function is separable from those of other modules. Here, we investigate the in silico evolution of modularity and robustness in complex artificial metabolic networks that encode an increasing amount of information about their environment while acquiring ubiquitous features of biological, social, and engineering networks, such as scale-free edge distribution, small-world property, and fault-tolerance. These networks evolve in environments that differ in their predictability, and allow us to study modularity from topological, information-theoretic, and gene-epistatic points of view using new tools that do not depend on any preconceived notion of modularity. We find that for our evolved complex networks as well as for the yeast protein–protein interaction network, synthetic lethal gene pairs consist mostly of redundant genes that lie close to each other and therefore within modules, while knockdown suppressor gene pairs are farther apart and often straddle modules, suggesting that knockdown rescue is mediated by alternative pathways or modules. The combination of network modularity tools together with genetic interaction data constitutes a powerful approach to study and dissect the role of modularity in the evolution and function of biological networks.  相似文献   

11.
We consider previously proposed procedures for generating clustered networks and investigate how these procedures lead to differences in network properties other than clustering. We interpret our findings in terms of the effect of the network structure on the disease outbreak threshold and disease dynamics. To generate null-model networks for comparison, we implement an assortativity-conserving rewiring algorithm that alters the level of clustering while causing minimal impact on other properties. We show that many theoretical network models used to generate networks with a particular property often lead to significant changes in network properties other than that of interest. For high levels of clustering, different procedures lead to networks that differ in degree heterogeneity and assortativity, and in broader scale measures such as ?(0) and the distribution of shortest path lengths. Hence, care must be taken when investigating the implications of network properties for disease transmission or other dynamic process that the network supports.  相似文献   

12.
We propose a growing network model that consists of two tunable mechanisms: growth by merging modules which are represented as complete graphs and a fitness-driven preferential attachment. Our model exhibits the three prominent statistical properties are widely shared in real biological networks, for example gene regulatory, protein-protein interaction, and metabolic networks. They retain three power law relationships, such as the power laws of degree distribution, clustering spectrum, and degree-degree correlation corresponding to scale-free connectivity, hierarchical modularity, and disassortativity, respectively. After making comparisons of these properties between model networks and biological networks, we confirmed that our model has inference potential for evolutionary processes of biological networks.  相似文献   

13.
Many complex networks such as computer and social networks exhibit modular structures, where links between nodes are much denser within modules than between modules. It is widely believed that cellular networks are also modular, reflecting the relative independence and coherence of different functional units in a cell. While many authors have claimed that observations from the yeast protein–protein interaction (PPI) network support the above hypothesis, the observed structural modularity may be an artifact because the current PPI data include interactions inferred from protein complexes through approaches that create modules (e.g., assigning pairwise interactions among all proteins in a complex). Here we analyze the yeast PPI network including protein complexes (PIC network) and excluding complexes (PEC network). We find that both PIC and PEC networks show a significantly greater structural modularity than that of randomly rewired networks. Nonetheless, there is little evidence that the structural modules correspond to functional units, particularly in the PEC network. More disturbingly, there is no evolutionary conservation among yeast, fly, and nematode modules at either the whole-module or protein-pair level. Neither is there a correlation between the evolutionary or phylogenetic conservation of a protein and the extent of its participation in various modules. Using computer simulation, we demonstrate that a higher-than-expected modularity can arise during network growth through a simple model of gene duplication, without natural selection for modularity. Taken together, our results suggest the intriguing possibility that the structural modules in the PPI network originated as an evolutionary byproduct without biological significance.  相似文献   

14.
Mutualistic interactions involving pollination and ant-plant mutualistic networks typically feature tightly linked species grouped in modules. However, such modularity is infrequent in seed dispersal networks, presumably because research on those networks predominantly includes a single taxonomic animal group (e.g. birds). Herein, for the first time, we examine the pattern of interaction in a network that includes multiple taxonomic groups of seed dispersers, and the mechanisms underlying modularity. We found that the network was nested and modular, with five distinguishable modules. Our examination of the mechanisms underlying such modularity showed that plant and animal trait values were associated with specific modules but phylogenetic effect was limited. Thus, the pattern of interaction in this network is only partially explained by shared evolutionary history. We conclude that the observed modularity emerged by a combination of phylogenetic history and trait convergence of phylogenetically unrelated species, shaped by interactions with particular types of dispersal agents.  相似文献   

15.
Real networks, including biological networks, are known to have the small-world property, characterized by a small “diameter”, which is defined as the average minimal path length between all pairs of nodes in a network. Because random networks also have short diameters, one may predict that the diameter of a real network should be even shorter than its random expectation, because having shorter diameters potentially increases the network efficiency such as minimizing transition times between metabolic states in the context of metabolic networks. Contrary to this expectation, we here report that the observed diameter is greater than the random expectation in every real network examined, including biological, social, technological, and linguistic networks. Simulations show that a modest enlargement of the diameter beyond its expectation allows a substantial increase of the network modularity, which is present in all real networks examined. Hence, short diameters appear to be sacrificed for high modularities, suggesting a tradeoff between network efficiency and advantages offered by modularity (e.g., multi-functionality, robustness, and/or evolvability).  相似文献   

16.
Hierarchical organization—the recursive composition of sub-modules—is ubiquitous in biological networks, including neural, metabolic, ecological, and genetic regulatory networks, and in human-made systems, such as large organizations and the Internet. To date, most research on hierarchy in networks has been limited to quantifying this property. However, an open, important question in evolutionary biology is why hierarchical organization evolves in the first place. It has recently been shown that modularity evolves because of the presence of a cost for network connections. Here we investigate whether such connection costs also tend to cause a hierarchical organization of such modules. In computational simulations, we find that networks without a connection cost do not evolve to be hierarchical, even when the task has a hierarchical structure. However, with a connection cost, networks evolve to be both modular and hierarchical, and these networks exhibit higher overall performance and evolvability (i.e. faster adaptation to new environments). Additional analyses confirm that hierarchy independently improves adaptability after controlling for modularity. Overall, our results suggest that the same force–the cost of connections–promotes the evolution of both hierarchy and modularity, and that these properties are important drivers of network performance and adaptability. In addition to shedding light on the emergence of hierarchy across the many domains in which it appears, these findings will also accelerate future research into evolving more complex, intelligent computational brains in the fields of artificial intelligence and robotics.  相似文献   

17.
Complex networks describe a wide range of systems in nature and society. To understand complex networks, it is crucial to investigate their community structure. In this paper, we develop an online community detection algorithm with linear time complexity for large complex networks. Our algorithm processes a network edge by edge in the order that the network is fed to the algorithm. If a new edge is added, it just updates the existing community structure in constant time, and does not need to re-compute the whole network. Therefore, it can efficiently process large networks in real time. Our algorithm optimizes expected modularity instead of modularity at each step to avoid poor performance. The experiments are carried out using 11 public data sets, and are measured by two criteria, modularity and NMI (Normalized Mutual Information). The results show that our algorithm''s running time is less than the commonly used Louvain algorithm while it gives competitive performance.  相似文献   

18.
Many ecological systems can be represented as networks of interactions. A key feature in these networks is their organization into modules, which are subsets of tightly connected elements. We introduce MODULAR to perform rapid and autonomous calculation of modularity in network sets. MODULAR reads a set of files representing unipartite or bipartite networks, and identifies modules using two different modularity metrics widely used in the ecological networks literature. To estimate modularity, the software offers five optimization methods to the user. The software also includes two null models commonly used in studies of ecological networks to verify how the degree of modularity differs from two distinct theoretical benchmarks.  相似文献   

19.
Assortative mixing in Protein Contact Networks and protein folding kinetics   总被引:2,自引:0,他引:2  
MOTIVATION: Starting from linear chains of amino acids, the spontaneous folding of proteins into their elaborate 3D structures is one of the remarkable examples of biological self-organization. We investigated native state structures of 30 single-domain, two-state proteins, from complex networks perspective, to understand the role of topological parameters in proteins' folding kinetics, at two length scales--as 'Protein Contact Networks (PCNs)' and their corresponding 'Long-range Interaction Networks (LINs)' constructed by ignoring the short-range interactions. RESULTS: Our results show that, both PCNs and LINs exhibit the exceptional topological property of 'assortative mixing' that is absent in all other biological and technological networks studied so far. We show that the degree distribution of these contact networks is partly responsible for the observed assortativity. The coefficient of assortativity also shows a positive correlation with the rate of protein folding at both short- and long-contact scale, whereas, the clustering coefficients of only the LINs exhibit a negative correlation. The results indicate that the general topological parameters of these naturally evolved protein networks can effectively represent the structural and functional properties required for fast information transfer among the residues facilitating biochemical/kinetic functions, such as, allostery, stability and the rate of folding. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.  相似文献   

20.
Acanthocytes, abnormal thorny red blood cells (RBC), are one of the biological hallmarks of neuroacanthocytosis syndromes (NA), a group of rare hereditary neurodegenerative disorders. Since RBCs are easily accessible, the study of acanthocytes in NA may provide insights into potential mechanisms of neurodegeneration. Previous studies have shown that changes in RBC membrane protein phosphorylation state affect RBC membrane mechanical stability and morphology. Here, we coupled tyrosine-phosphoproteomic analysis to topological network analysis. We aimed to predict signaling sub-networks possibly involved in the generation of acanthocytes in patients affected by the two core NA disorders, namely McLeod syndrome (MLS, XK-related, Xk protein) and chorea-acanthocytosis (ChAc, VPS13A-related, chorein protein). The experimentally determined phosphoproteomic data-sets allowed us to relate the subsequent network analysis to the pathogenetic background. To reduce the network complexity, we combined several algorithms of topological network analysis including cluster determination by shortest path analysis, protein categorization based on centrality indexes, along with annotation-based node filtering. We first identified XK- and VPS13A-related protein-protein interaction networks by identifying all the interactomic shortest paths linking Xk and chorein to the corresponding set of proteins whose tyrosine phosphorylation was altered in patients. These networks include the most likely paths of functional influence of Xk and chorein on phosphorylated proteins. We further refined the analysis by extracting restricted sets of highly interacting signaling proteins representing a common molecular background bridging the generation of acanthocytes in MLS and ChAc. The final analysis pointed to a novel, very restricted, signaling module of 14 highly interconnected kinases, whose alteration is possibly involved in generation of acanthocytes in MLS and ChAc.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号