Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “protein interaction networks”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 recordsLinked to original sources
PubMed2004

Functional evolution of the yeast protein interaction network.

Protein interactions are central to most biological processes. We investigated the dynamics of emergence of the protein interaction network of Saccharomyces cerevisiae by mapping origins of proteins on an evolutionary tree. We demonstrate that evolutionary periods are characterized by distinct connectivity levels of the emerging proteins. We found that the most-connected group of proteins dates to the eukaryotic radiation, and the more ancient group of pre-eukaryotic proteins is less connected. We show that functional classes have different average connectivity levels and that the time of emergence of these functional classes parallels the observed connectivity variation in evolution. We take these findings as evidence that the evolution of function might be the reason for the differences in connectivity throughout evolutionary time. We propose that the understanding of the mechanisms that generate the scale-free protein interaction network, and possibly other biological networks, requires consideration of protein function.

Computational Biology↗
PubMed2004

Three-dimensional visualization of protein interaction networks.

Protein interaction networks provide us with contextual information within which protein function can be interpreted and will assist many biomedical studies. We have developed a new force-directed layout algorithm for visualizing protein interactions in three-dimensional space. Our algorithm divides nodes into three groups based on their interacting properties: bi-connected sub-graph in the center, terminal nodes at the outermost region, and the rest in between them. Experimental results show that our algorithm efficiently generates a clear and aesthetically pleasing drawing of large-scale protein interaction networks and that it is an order of magnitude faster than other force-directed layouts.

Algorithms↗
PubMed2004

An exponential core in the heart of the yeast protein interaction network.

Protein interactions in the budding yeast have been shown to form a scale-free network, a feature of other organized networks such as bacterial and archaeal metabolism and the World Wide Web. Here, we study the connections established by yeast proteins and discover a preferential attachment between essential proteins. The essential-essential connections are long ranged and form a subnetwork where the giant component includes 97% of these proteins. Unexpectedly, this subnetwork displays an exponential connectivity distribution, in sharp contrast to the scale-free topology of the complete network. Furthermore, the wide phylogenetic extent of these core proteins and interactions provides evidence that they represent the ancestral state of the yeast protein interaction network. Finally, we propose that this core exponential network may represent a generic scaffold around which organism-specific and taxon-specific proteins and interactions coalesce.

Models, Biological↗
PubMed2005

Flexible nets. The roles of intrinsic disorder in protein interaction networks.

Proteins participate in complex sets of interactions that represent the mechanistic foundation for much of the physiology and function of the cell. These protein-protein interactions are organized into exquisitely complex networks. The architecture of protein-protein interaction networks was recently proposed to be scale-free, with most of the proteins having only one or two connections but with relatively fewer 'hubs' possessing tens, hundreds or more links. The high level of hub connectivity must somehow be reflected in protein structure. What structural quality of hub proteins enables them to interact with large numbers of diverse targets? One possibility would be to employ binding regions that have the ability to bind multiple, structurally diverse partners. This trait can be imparted by the incorporation of intrinsic disorder in one or both partners. To illustrate the value of such contributions, this review examines the roles of intrinsic disorder in protein network architecture. We show that there are three general ways that intrinsic disorder can contribute: First, intrinsic disorder can serve as the structural basis for hub protein promiscuity; secondly, intrinsically disordered proteins can bind to structured hub proteins; and thirdly, intrinsic disorder can provide flexible linkers between functional domains with the linkers enabling mechanisms that facilitate binding diversity. An important research direction will be to determine what fraction of protein-protein interaction in regulatory networks relies on intrinsic disorder.

Animals↗
PubMed2005

Comparative analysis of the Saccharomyces cerevisiae and Caenorhabditis elegans protein interaction networks.

BACKGROUND: Protein interaction networks aim to summarize the complex interplay of proteins in an organism. Early studies suggested that the position of a protein in the network determines its evolutionary rate but there has been considerable disagreement as to what extent other factors, such as protein abundance, modify this reported dependence. RESULTS: We compare the genomes of Saccharomyces cerevisiae and Caenorhabditis elegans with those of closely related species to elucidate the recent evolutionary history of their respective protein interaction networks. Interaction and expression data are studied in the light of a detailed phylogenetic analysis. The underlying network structure is incorporated explicitly into the statistical analysis. The increased phylogenetic resolution, paired with high-quality interaction data, allows us to resolve the way in which protein interaction network structure and abundance of proteins affect the evolutionary rate. We find that expression levels are better predictors of the evolutionary rate than a protein's connectivity. Detailed analysis of the two organisms also shows that the evolutionary rates of interacting proteins are not sufficiently similar to be mutually predictive. CONCLUSION: It appears that meaningful inferences about the evolution of protein interaction networks require comparative analysis of reasonably closely related species. The signature of protein evolution is shaped by a protein's abundance in the organism and its function and the biological process it is involved in. Its position in the interaction networks and its connectivity may modulate this but they appear to have only minor influence on a protein's evolutionary rate.

Animals↗
PubMed2006

Circumventing the problems caused by protein diversity in microarrays: implications for protein interaction networks.

Protein microarrays provide a well-controlled, high-throughput way to uncover protein-protein interactions. One problem with this and other standardized assays, however, is that proteins vary considerably with respect to their physical properties. If a simple threshold-based approach is used to define protein-protein interactions, the resulting binary networks can be strongly biased. Here, we investigate the extent to which even closely related protein interaction domains vary when printed as microarrays. We find that, when a collection of well behaved, monomeric Src homology 2 (SH2) domains are printed at the same concentration, they vary by up to 50-fold with respect to the resulting surface density of active protein. When a threshold-based binding assay is performed on these domains using fluorescently labeled phosphopeptides, a misleading picture of the underlying biophysical interactions emerges. This problem can be circumvented, however, by obtaining saturation binding curves for each protein-peptide interaction. Importantly, the equilibrium dissociation constants obtained from these curves are independent of the surface density of active protein. We submit that an increased emphasis should be placed on obtaining quantitative information from protein microarrays and that this should serve as a more general goal in all efforts to define large-scale protein interaction networks.

Biosensing Techniques↗
PubMed2006

Social behavior of the yeast protein-protein interaction network.

Protein-protein interaction networks are useful in contextual annotation of protein function and in general to achieve a system-level understanding of cellular behavior. This work reports on the social behavior of the yeast protein-protein interaction network and concludes that it is non-random. This work, while providing an analysis of organization of genes into functional societies, can potentially be useful in assessing the accuracy of contextual gene annotation based on such interaction networks.

Computational Biology↗
PubMed2006

Functional nonsynonymous single nucleotide polymorphisms from the TGF-beta protein interaction network.

Protein complexes mediated by protein-protein interactions are essential for many cellular functions. Transforming growth factor (TGF)-beta signaling involves a cascade of protein-protein interactions and malfunctioning of this pathway has been implicated in human diseases. Using an in silico approach, we analyzed the naturally occurring human genetic variations from the proteins involved in the TGF-beta signaling (10 TGF-beta proteins and 242 other proteins interacting with them) to identify the ones that have potential biological consequences. All proteins were searched in the dbSNP database for the presence of nonsynonymous single nucleotide polymorphisms (nsSNPs). A total of 118 validated nsSNPs from 63 proteins were retrieved and analyzed in terms of 1) evolutionary conservation status, 2) being located in a functional protein domain or motif, and 3) altering putative protein motif or phosphorylation sites. Our results indicated the presence of 31 nsSNPs that occurred at evolutionarily conserved residues, 37 nsSNPs were located in protein domains, motifs, or repeats, and 46 nsSNPs were predicted to either create or abolish putative protein motifs or phosphorylation sites. We undertook this study to analyze the human genetic variations that can affect the protein function and the TGF-beta signaling. The nsSNPs reported in here can be characterized by experimental approaches to elucidate their exact biological roles and whether they are related to human disease.

Computational Biology↗
PubMed2003

Visualisation and navigation methods for typed protein-protein interaction networks.

Protein-protein interactions form large and complex networks. Their visualisation can aid biologists in gaining new insights about the processes in cells and is, therefore, very useful for building sophisticated research tools. Often standard force-directed graph drawing algorithms are used for the visualisation of these networks. However, currently available visual interfaces to biological databases only show general interactions and cannot cope well with more complex networks with different types of interactions. This paper presents a new approach to the visual analysis of protein-protein interaction networks. It uses a combination of circular and force-directed graph drawing algorithms to compute visual representations of protein networks depending on the type of the selected interaction. Smooth transitions between subsequent drawings enable users to explore different functional clusters in these networks without getting lost in the entire network. The visualisation system has been tested with data from the BRITE database.

Algorithms↗
PubMed2006

Protein bipartivity and essentiality in the yeast protein-protein interaction network.

Protein-protein interaction networks (PINs) are structured by means of a few highly connected proteins linked to a large number of less-connected ones. Essential proteins have been found to be more abundant among these highly connected proteins. Here we demonstrate that the likelihood that removal of a protein in a PIN will prove lethal to yeast correlates with the lack of bipartivity of the protein. A protein is bipartite if it can be partitioned in such a way that there are two groups of proteins with intergroup, but not intragroup, interactions. The abundance of essential proteins found among the least bipartite proteins clearly exceeds that found among the most connected ones. For instance, among the top 50 proteins ranked by their lack of bipartivity 62% are essential proteins. However, this percentage is only 38% for proteins ranked according to their number of interactions. Protein bipartivity also surpasses another 5 measures of protein centrality in yeast PIN in identifying essential proteins and doubles the number of essential proteins selected at random. We propose a possible mechanism for the evolution of essential proteins in yeast PIN based on the duplication-divergence scheme. We conclude that a replica protein evolving from a nonbipartite target will also be nonbipartite with high probability. Consequently, these new replicas evolving from nonbipartite (essential) targets will with high probability be essential.

Evolution, Molecular↗
PubMed2005

High-betweenness proteins in the yeast protein interaction network.

Structural features found in biomolecular networks that are absent in random networks produced by simple algorithms can provide insight into the function and evolution of cell regulatory networks. Here we analyze "betweenness" of network nodes, a graph theoretical centrality measure, in the yeast protein interaction network. Proteins that have high betweenness, but low connectivity (degree), were found to be abundant in the yeast proteome. This finding is not explained by algorithms proposed to explain the scale-free property of protein interaction networks, where low-connectivity proteins also have low betweenness. These data suggest the existence of some modular organization of the network, and that the high-betweenness, low-connectivity proteins may act as important links between these modules. We found that proteins with high betweenness are more likely to be essential and that evolutionary age of proteins is positively correlated with betweenness. By comparing different models of genome evolution that generate scale-free networks, we show that rewiring of interactions via mutation is an important factor in the production of such proteins. The evolutionary and functional significance of these observations are discussed.

Journal Article↗
PubMed2006

Evaluation of clustering algorithms for protein-protein interaction networks.

BACKGROUND: Protein interactions are crucial components of all cellular processes. Recently, high-throughput methods have been developed to obtain a global description of the interactome (the whole network of protein interactions for a given organism). In 2002, the yeast interactome was estimated to contain up to 80,000 potential interactions. This estimate is based on the integration of data sets obtained by various methods (mass spectrometry, two-hybrid methods, genetic studies). High-throughput methods are known, however, to yield a non-negligible rate of false positives, and to miss a fraction of existing interactions. The interactome can be represented as a graph where nodes correspond with proteins and edges with pairwise interactions. In recent years clustering methods have been developed and applied in order to extract relevant modules from such graphs. These algorithms require the specification of parameters that may drastically affect the results. In this paper we present a comparative assessment of four algorithms: Markov Clustering (MCL), Restricted Neighborhood Search Clustering (RNSC), Super Paramagnetic Clustering (SPC), and Molecular Complex Detection (MCODE). RESULTS: A test graph was built on the basis of 220 complexes annotated in the MIPS database. To evaluate the robustness to false positives and false negatives, we derived 41 altered graphs by randomly removing edges from or adding edges to the test graph in various proportions. Each clustering algorithm was applied to these graphs with various parameter settings, and the clusters were compared with the annotated complexes. We analyzed the sensitivity of the algorithms to the parameters and determined their optimal parameter values. We also evaluated their robustness to alterations of the test graph. We then applied the four algorithms to six graphs obtained from high-throughput experiments and compared the resulting clusters with the annotated complexes. CONCLUSION: This analysis shows that MCL is remarkably robust to graph alterations. In the tests of robustness, RNSC is more sensitive to edge deletion but less sensitive to the use of suboptimal parameter values. The other two algorithms are clearly weaker under most conditions. The analysis of high-throughput data supports the superiority of MCL for the extraction of complexes from interaction networks.

Algorithms↗
PubMed2004

Evidence for dynamically organized modularity in the yeast protein-protein interaction network.

In apparently scale-free protein-protein interaction networks, or 'interactome' networks, most proteins interact with few partners, whereas a small but significant proportion of proteins, the 'hubs', interact with many partners. Both biological and non-biological scale-free networks are particularly resistant to random node removal but are extremely sensitive to the targeted removal of hubs. A link between the potential scale-free topology of interactome networks and genetic robustness seems to exist, because knockouts of yeast genes encoding hubs are approximately threefold more likely to confer lethality than those of non-hubs. Here we investigate how hubs might contribute to robustness and other cellular properties for protein-protein interactions dynamically regulated both in time and in space. We uncovered two types of hub: 'party' hubs, which interact with most of their partners simultaneously, and 'date' hubs, which bind their different partners at different times or locations. Both in silico studies of network connectivity and genetic interactions described in vivo support a model of organized modularity in which date hubs organize the proteome, connecting biological processes--or modules--to each other, whereas party hubs function inside modules.

Computer Simulation↗
PubMed2003

An automated method for finding molecular complexes in large protein interaction networks.

BACKGROUND: Recent advances in proteomics technologies such as two-hybrid, phage display and mass spectrometry have enabled us to create a detailed map of biomolecular interaction networks. Initial mapping efforts have already produced a wealth of data. As the size of the interaction set increases, databases and computational methods will be required to store, visualize and analyze the information in order to effectively aid in knowledge discovery. RESULTS: This paper describes a novel graph theoretic clustering algorithm, "Molecular Complex Detection" (MCODE), that detects densely connected regions in large protein-protein interaction networks that may represent molecular complexes. The method is based on vertex weighting by local neighborhood density and outward traversal from a locally dense seed protein to isolate the dense regions according to given parameters. The algorithm has the advantage over other graph clustering methods of having a directed mode that allows fine-tuning of clusters of interest without considering the rest of the network and allows examination of cluster interconnectivity, which is relevant for protein networks. Protein interaction and complex information from the yeast Saccharomyces cerevisiae was used for evaluation. CONCLUSION: Dense regions of protein interaction networks can be found, based solely on connectivity data, many of which correspond to known protein complexes. The algorithm is not affected by a known high rate of false positives in data from high-throughput interaction techniques. The program is available from ftp://ftp.mshri.on.ca/pub/BIND/Tools/MCODE.

Algorithms↗
PubMed2005

Lethality and entropy of protein interaction networks.

We characterize protein interaction networks in terms of network entropy. This approach suggests a ranking principle, which strongly correlates with elements of functional importance, such as lethal proteins. Our combined analysis of protein interaction networks and functional profiles in single cellular yeast and multi-cellular worm shows that proteins with large contribution to network entropy are preferentially lethal. While entropy is inherently a dynamical concept, the present analysis incorporates only structural information. Our result therefore highlights the importance of topological features, which appear as correlates of an underlying dynamical property, and which in turn determine functional traits. We argue that network entropy is a natural extension of previously studied observables, such as pathway multiplicity and centrality. It is also applicable to networks in which the processes can be quantified and therefore serves as a link to study questions of structural and dynamical robustness in a unified way.

Animals↗
PubMed2003

Global protein function prediction from protein-protein interaction networks.

Determining protein function is one of the most challenging problems of the post-genomic era. The availability of entire genome sequences and of high-throughput capabilities to determine gene coexpression patterns has shifted the research focus from the study of single proteins or small complexes to that of the entire proteome. In this context, the search for reliable methods for assigning protein function is of primary importance. There are various approaches available for deducing the function of proteins of unknown function using information derived from sequence similarity or clustering patterns of co-regulated genes, phylogenetic profiles, protein-protein interactions (refs. 5-8 and Samanta, M.P. and Liang, S., unpublished data), and protein complexes. Here we propose the assignment of proteins to functional classes on the basis of their network of physical interactions as determined by minimizing the number of protein interactions among different functional categories. Function assignment is proteome-wide and is determined by the global connectivity pattern of the protein network. The approach results in multiple functional assignments, a consequence of the existence of multiple equivalent solutions. We apply the method to analyze the yeast Saccharomyces cerevisiae protein-protein interaction network. The robustness of the approach is tested in a system containing a high percentage of unclassified proteins and also in cases of deletion and insertion of specific protein interactions.

Algorithms↗
PubMed2004

Regulatory evolution across the protein interaction network.

Protein-protein interactions may impose constraints on both structural and regulatory evolution. Here we show that protein-protein interactions are negatively associated with evolutionary variation in gene expression. Moreover, interacting proteins have similar levels of variation in expression, and their expression levels are positively correlated across strains. Our results suggest that interacting proteins undergo similar evolutionary dynamics, and that their expression levels are evolutionarily coupled. These patterns hold for organisms as diverse as budding yeast and fruit flies.

Animals↗
PubMed2003

Complexity management in visualizing protein interaction networks.

MOTIVATION: Protein-protein interaction networks often consist of thousands of nodes or more. This severely limits the utility of many graph drawing tools because they become too slow for an interactive analysis of the networks and because they produce cluttered drawings with many edge crossings. RESULTS: A new layout algorithm with complexity management operations in visualizing a large-scale protein interaction network was developed and implemented in a program called InterViewer3. InterViewer3 simplifies a complex network by collapsing a group of nodes with the same interacting partners into a composite node and by replacing a clique with a star-shaped subgraph. The experimental results demonstrated that InterViewer3 is one order of magnitude faster than the other drawing programs and that its complexity management is successful.

Algorithms↗