共查询到20条相似文献,搜索用时 31 毫秒
1.
Determining protein interaction networks and generating models to simulate network changes in time and space are crucial for understanding a biological system and for predicting the effect of mutants found in diseases. In this review we discuss the great potential of using structural information together with computational tools towards reaching this goal: the prediction of new protein interactions, the estimation of affinities and kinetic rate constants between protein complexes, and finally the determination of which interactions are compatible with each other and which interactions are exclusive. The latter one will be important to reorganize large scale networks into functional modular networks. 相似文献
2.
Proteins interact in complex protein–protein interaction (PPI) networks whose topological properties—such as scale-free topology, hierarchical modularity, and dissortativity—have suggested models of network evolution. Currently preferred models invoke preferential attachment or gene duplication and divergence to produce networks whose topology matches that observed for real PPIs, thus supporting these as likely models for network evolution. Here, we show that the interaction density and homodimeric frequency are highly protein age–dependent in real PPI networks in a manner which does not agree with these canonical models. In light of these results, we propose an alternative stochastic model, which adds each protein sequentially to a growing network in a manner analogous to protein crystal growth (CG) in solution. The key ideas are (1) interaction probability increases with availability of unoccupied interaction surface, thus following an anti-preferential attachment rule, (2) as a network grows, highly connected sub-networks emerge into protein modules or complexes, and (3) once a new protein is committed to a module, further connections tend to be localized within that module. The CG model produces PPI networks consistent in both topology and age distributions with real PPI networks and is well supported by the spatial arrangement of protein complexes of known 3-D structure, suggesting a plausible physical mechanism for network evolution. 相似文献
3.
Conventionally, biological signal transduction networks are analysed using experimental and theoretical methods to describe specific protein components, interactions, and biochemical processes and to model network behavior under various conditions. While these studies provide crucial information on specific networks, this information is not easily converted to a broader understanding of signal transduction systems. Here, using a specific model of protein interaction we analyse small network topologies to understand their response and general properties. In particular, we catalogue the response for all possible topologies of a given network size to generate a response distribution, analyse the effects of specific biochemical processes on this distribution, and analyse the robustness and diversity of responses with respect to internal fluctuations or mutations in the network. The results show that even three- and four-protein networks are capable of creating diverse and biologically relevant responses, that the distribution of response types changes drastically as a function of biochemical processes at protein level, and that certain topologies strongly pre-dispose a specific response type while others allow for diverse types of responses. This study sheds light on the response types and properties that could be expected from signal transduction networks, provides possible explanations for the role of certain biochemical processes in signal transduction and suggests novel approaches to interfere with signaling pathways at the molecular level. Furthermore it shows that network topology plays a key role on determining response type and properties and that proper representation of network topology is crucial to discover and understand so-called building blocks of large networks. 相似文献
4.
Mehmet Koyutürk Yohan Kim Umut Topkara Shankar Subramaniam Wojciech Szpankowski Ananth Grama 《Journal of computational biology》2006,13(2):182-199
With an ever-increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discovery of conserved patterns in these networks becomes an important problem. Although available data on protein-protein interactions is currently limited, recently developed algorithms have been shown to convey novel biological insights through employment of elegant mathematical models. The main challenge in aligning PPI networks is to define a graph theoretical measure of similarity between graph structures that captures underlying biological phenomena accurately. In this respect, modeling of conservation and divergence of interactions, as well as the interpretation of resulting alignments, are important design parameters. In this paper, we develop a framework for comprehensive alignment of PPI networks, which is inspired by duplication/divergence models that focus on understanding the evolution of protein interactions. We propose a mathematical model that extends the concepts of match, mismatch, and gap in sequence alignment to that of match, mismatch, and duplication in network alignment and evaluates similarity between graph structures through a scoring function that accounts for evolutionary events. By relying on evolutionary models, the proposed framework facilitates interpretation of resulting alignments in terms of not only conservation but also divergence of modularity in PPI networks. Furthermore, as in the case of sequence alignment, our model allows flexibility in adjusting parameters to quantify underlying evolutionary relationships. Based on the proposed model, we formulate PPI network alignment as an optimization problem and present fast algorithms to solve this problem. Detailed experimental results from an implementation of the proposed framework show that our algorithm is able to discover conserved interaction patterns very effectively, in terms of both accuracies and computational cost. 相似文献
5.
Establishing protein interaction networks is crucial for understanding cellular operations. Detailed knowledge of the 'interactome', the full network of protein-protein interactions, in model cellular systems should provide new insights into the structure and properties of these systems. Parallel to the first massive application of experimental techniques to the determination of protein interaction networks and protein complexes, the first computational methods, based on sequence and genomic information, have emerged. 相似文献
6.
Mehmet Koyutürk Wojciech Szpankowski Ananth Grama 《Journal of computational biology》2007,14(6):747-764
Comparative analyses of cellular interaction networks enable understanding of the cell's modular organization through identification of functional modules and complexes. These techniques often rely on topological features such as connectedness and density, based on the premise that functionally related proteins are likely to interact densely and that these interactions follow similar evolutionary trajectories. Significant recent work has focused on efficient algorithms for identification of such functional modules and their conservation. In spite of algorithmic advances, development of a comprehensive infrastructure for interaction databases is in relative infancy compared to corresponding sequence analysis tools. One critical, and as yet unresolved aspect of this infrastructure is a measure of the statistical significance of a match, or a dense subcomponent. In the absence of analytical measures, conventional methods rely on computationally expensive simulations based on ad-hoc models for quantifying significance. In this paper, we present techniques for analytically quantifying statistical significance of dense components in reference model graphs. We consider two reference models--a G(n, p) model in which each pair of nodes in a graph has an identical likelihood, p, of sharing an edge, and a two-level G(n, p) model, which accounts for high-degree hub nodes generally observed in interaction networks. Experiments performed on a rich collection of protein interaction (PPI) networks show that the proposed model provides a reliable means of evaluating statistical significance of dense patterns in these networks. We also adapt existing state-of-the-art network clustering algorithms by using our statistical significance measure as an optimization criterion. Comparison of the resulting module identification algorithm, SIDES, with existing methods shows that SIDES outperforms existing algorithms in terms of sensitivity and specificity of identified clusters with respect to available GO annotations. 相似文献
7.
Much attention has recently been given to the statistical significance of topological features observed in biological networks. Here, we consider residue interaction graphs (RIGs) as network representations of protein structures with residues as nodes and inter-residue interactions as edges. Degree-preserving randomized models have been widely used for this purpose in biomolecular networks. However, such a single summary statistic of a network may not be detailed enough to capture the complex topological characteristics of protein structures and their network counterparts. Here, we investigate a variety of topological properties of RIGs to find a well fitting network null model for them. The RIGs are derived from a structurally diverse protein data set at various distance cut-offs and for different groups of interacting atoms. We compare the network structure of RIGs to several random graph models. We show that 3-dimensional geometric random graphs, that model spatial relationships between objects, provide the best fit to RIGs. We investigate the relationship between the strength of the fit and various protein structural features. We show that the fit depends on protein size, structural class, and thermostability, but not on quaternary structure. We apply our model to the identification of significantly over-represented structural building blocks, i.e., network motifs, in protein structure networks. As expected, choosing geometric graphs as a null model results in the most specific identification of motifs. Our geometric random graph model may facilitate further graph-based studies of protein conformation space and have important implications for protein structure comparison and prediction. The choice of a well-fitting null model is crucial for finding structural motifs that play an important role in protein folding, stability and function. To our knowledge, this is the first study that addresses the challenge of finding an optimized null model for RIGs, by comparing various RIG definitions against a series of network models. 相似文献
8.
Interactive proteomics addresses the physical associations among proteins and establishes global, disease-, and pathway-specific protein interaction networks. The inherent chemical and structural diversity of proteins, their different expression levels, and their distinct subcellular localizations pose unique challenges for the exploration of these networks, necessitating the use of a variety of innovative and ingenious approaches. Consequently, recent years have seen exciting developments in protein interaction mapping and the establishment of very large interaction networks, especially in model organisms. In the near future, attention will shift to the establishment of interaction networks in humans and their application in drug discovery and understanding of diseases. In this review, we present an impressive toolbox of different technologies that we expect to be crucial for interactive proteomics in the coming years. 相似文献
9.
10.
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. 相似文献
11.
Understanding a complex network's structure holds the key to understanding its function. The physics community has contributed a multitude of methods and analyses to this cross-disciplinary endeavor. Structural features exist on both the microscopic level, resulting from differences between single node properties, and the mesoscopic level resulting from properties shared by groups of nodes. Disentangling the determinants of network structure on these different scales has remained a major, and so far unsolved, challenge. Here we show how multiscale generative probabilistic exponential random graph models combined with efficient, distributive message-passing inference techniques can be used to achieve this separation of scales, leading to improved detection accuracy of latent classes as demonstrated on benchmark problems. It sheds new light on the statistical significance of motif-distributions in neural networks and improves the link-prediction accuracy as exemplified for gene-disease associations in the highly consequential Online Mendelian Inheritance in Man database. 相似文献
12.
In this paper we propose a generalized growth model for biological interaction networks, including a set of biological features which have been inspired by a long tradition of simulations of immune system and chemical reaction networks. In our models we include characteristics such as the heterogeneity of biological nodes, the existence of natural hubs, the nodes binding by mutual affinity and the significance of type-based networks as compared with instance-based networks. Under these assumptions, we analyse the importance of the nodes concentration with respect to the selection of incoming nodes. We show that networks with fat-tailed degree distribution and highly clustered structure naturally emerge in systems possessing certain properties: new instances need to be produced through an endogenous source and this source needs to provide a positive feedback favouring nodes with high concentration to receive new connections. Furthermore, we show that understanding the concentration dynamics of each node and the consequent correlation between connectivity and concentration is a more adequate way to capture the global properties of type-based biological networks. 相似文献
13.
Proteins are molecular machines composed of complex, highly connected amino acid networks. Their functional optimization requires the reorganization of these intramolecular networks by evolution. In this review, we discuss the mechanisms by which epistasis, that is, the dependence of the effect of a mutation on the genetic background, rewires intramolecular interactions to alter protein function. Deciphering the biophysical basis of epistasis is crucial to our understanding of evolutionary dynamics and the elucidation of sequence-structure-function relationships. We featured recent studies that provide insights into the molecular mechanisms giving rise to epistasis, particularly at the structural level. These studies illustrate the convoluted and fascinating nature of the intramolecular networks co-opted by epistasis during the evolution of protein function. 相似文献
14.
Since Kauzmann's seminal 1959 paper, the hydrophobic interaction has dominated thinking on the forces that control protein folding and stability. Despite its wide importance in chemistry and biology, our understanding of this interaction at the molecular level remains poor, with little experimental evidence to support the idea of water ordering close to a non-polar group that is at the centre of the standard model for the source of the entropic driving force. Developments over recent years in neutron techniques now enable us to see directly how a non-polar group actually affects the molecular structure of the water in its immediate neighbourhood. On the basis of such work on aqueous solutions of small alcohols, the generally accepted standard model is found to be wanting, and alternative sources of the entropic driving force are suggested. Moreover, the fact that we can now follow changes in hydrogen bonding as the alcohol concentration is varied gives us the possibility of explaining the concentration dependence of the enthalpy of mixing. Complementary studies of solute association on the mesoscopic scale show a rich concentration and temperature behaviour, which reflects a complex balance of polar and non-polar interactions. Unravelling the detailed nature of this balance in simple aqueous amphiphiles may lead to a better understanding of the forces that control biomolecular structural stability and interactions. 相似文献
15.
The vast majority of the chores in the living cell involve protein-protein interactions. Providing details of protein interactions at the residue level and incorporating them into protein interaction networks are crucial toward the elucidation of a dynamic picture of cells. Despite the rapid increase in the number of structurally known protein complexes, we are still far away from a complete network. Given experimental limitations, computational modeling of protein interactions is a prerequisite to proceed on the way to complete structural networks. In this work, we focus on the question 'how do proteins interact?' rather than 'which proteins interact?' and we review structure-based protein-protein interaction prediction approaches. As a sample approach for modeling protein interactions, PRISM is detailed which combines structural similarity and evolutionary conservation in protein interfaces to infer structures of complexes in the protein interaction network. This will ultimately help us to understand the role of protein interfaces in predicting bound conformations. 相似文献
16.
The study of individual amino acid residues and their molecular interactions in protein structures is crucial for understanding structure-function relationships. Recent work has indicated that residue networks derived from 3D protein structures provide additional insights into the structural and functional roles of interacting residues. Here, we present the new software tools RINerator and RINalyzer for the automatized generation, 2D visualization, and interactive analysis of residue interaction networks, and highlight their use in different application scenarios. 相似文献
17.
《Journal of molecular biology》2022,434(11):167608
Rapid progress in structural modeling of proteins and their interactions is powered by advances in knowledge-based methodologies along with better understanding of physical principles of protein structure and function. The pool of structural data for modeling of proteins and protein–protein complexes is constantly increasing due to the rapid growth of protein interaction databases and Protein Data Bank. The GWYRE (Genome Wide PhYRE) project capitalizes on these developments by advancing and applying new powerful modeling methodologies to structural modeling of protein–protein interactions and genetic variation. The methods integrate knowledge-based tertiary structure prediction using Phyre2 and quaternary structure prediction using template-based docking by a full-structure alignment protocol to generate models for binary complexes. The predictions are incorporated in a comprehensive public resource for structural characterization of the human interactome and the location of human genetic variants. The GWYRE resource facilitates better understanding of principles of protein interaction and structure/function relationships. The resource is available at http://www.gwyre.org. 相似文献
18.
Deterministic Boolean networks have been used as models of gene regulation and other biological networks. One key element in these models is the update schedule, which indicates the order in which states are to be updated. We study the robustness of the dynamical behavior of a Boolean network with respect to different update schedules (synchronous, block-sequential, sequential), which can provide modelers with a better understanding of the consequences of changes in this aspect of the model. For a given Boolean network, we define equivalence classes of update schedules with the same dynamical behavior, introducing a labeled graph which helps to understand the dependence of the dynamics with respect to the update, and to identify interactions whose timing may be crucial for the presence of a particular attractor of the system. Several other results on the robustness of update schedules and of dynamical cycles with respect to update schedules are presented. Finally, we prove that our equivalence classes generalize those found in sequential dynamical systems. 相似文献
19.
MOTIVATION: The structural interaction of proteins and their domains in networks is one of the most basic molecular mechanisms for biological cells. Topological analysis of such networks can provide an understanding of and solutions for predicting properties of proteins and their evolution in terms of domains. A single paradigm for the analysis of interactions at different layers, such as domain and protein layers, is needed. RESULTS: Applying a colored vertex graph model, we integrated two basic interaction layers under a unified model: (1) structural domains and (2) their protein/complex networks. We identified four basic and distinct elements in the model that explains protein interactions at the domain level. We searched for motifs in the networks to detect their topological characteristics using a pruning strategy and a hash table for rapid detection. We obtained the following results: first, compared with a random distribution, a substantial part of the protein interactions could be explained by domain-level structural interaction information. Second, there were distinct kinds of protein interaction patterns classified by specific and distinguishable numbers of domains. The intermolecular domain interaction was the most dominant protein interaction pattern. Third, despite the coverage of the protein interaction information differing among species, the similarity of their networks indicated shared architectures of protein interaction network in living organisms. Remarkably, there were only a few basic architectures in the model (>10 for a 4-node network topology), and we propose that most biological combinations of domains into proteins and complexes can be explained by a small number of key topological motifs. CONTACT: doheon@kaist.ac.kr. 相似文献