PinSnps: structural and functional analysis of SNPs in the context of protein interaction networks.
Ontology highlight
ABSTRACT: Unlabelled
We present a practical computational pipeline to readily perform data analyses of protein-protein interaction networks by using genetic and functional information mapped onto protein structures. We provide a 3D representation of the available protein structure and its regions (surface, interface, core and disordered) for the selected genetic variants and/or SNPs, and a prediction of the mutants' impact on the protein as measured by a range of methods. We have mapped in total 2587 genetic disorder-related SNPs from OMIM, 587 873 cancer-related variants from COSMIC, and 1 484 045 SNPs from dbSNP. All result data can be downloaded by the user together with an R-script to compute the enrichment of SNPs/variants in selected structural regions.Availability and implementation
PinSnps is available as open-access service at http://fraternalilab.kcl.ac.uk/PinSnps/Contact
franca.fraternali@kcl.ac.ukSupplementary information
Supplementary data are available at Bioinformatics online.
SUBMITTER: Lu HC
PROVIDER: S-EPMC4978923 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Protein-protein interactions are central to most biological processes. Although much recent effort has been put into methods to identify interacting partners, there has been a limited focus on how these interactions compare with those known from three-dimensional (3D) structures. Because comparison of protein interactions often involves considering homologous, but not identical, proteins, a key issue is whether proteins that are homologous to an interacting pair will interact in the same way, or interact at all. Accordingly, we describe a method to test putative interactions on complexes of known 3D structure. Given a 3D complex and alignments of homologues of the interacting proteins, we assess the fit of any possible interacting pair on the complex by using empirical potentials. For studies of interacting protein families that show different specificities, the method provides a ranking of interacting pairs useful for prioritizing experiments. We evaluate the method on interacting families of proteins with multiple complex structures. We then consider the fibroblast growth factor/receptor system and explore the intersection between complexes of known structure and interactions proposed between yeast proteins by methods such as two-hybrids. We provide confirmation for several interactions, in addition to suggesting molecular details of how they occur.
| S-EPMC122873 | biostudies-literature
Project description:MotivationIdentifying functional modules in protein-protein interaction (PPI) networks may shed light on cellular functional organization and thereafter underlying cellular mechanisms. Many existing module identification algorithms aim to detect densely connected groups of proteins as potential modules. However, based on this simple topological criterion of 'higher than expected connectivity', those algorithms may miss biologically meaningful modules of functional significance, in which proteins have similar interaction patterns to other proteins in networks but may not be densely connected to each other. A few blockmodel module identification algorithms have been proposed to address the problem but the lack of global optimum guarantee and the prohibitive computational complexity have been the bottleneck of their applications in real-world large-scale PPI networks.ResultsIn this article, we propose a novel optimization formulation LCP(2) (low two-hop conductance sets) using the concept of Markov random walk on graphs, which enables simultaneous identification of both dense and sparse modules based on protein interaction patterns in given networks through searching for LCP(2) by random walk. A spectral approximate algorithm SLCP(2) is derived to identify non-overlapping functional modules. Based on a bottom-up greedy strategy, we further extend LCP(2) to a new algorithm (greedy algorithm for LCP(2)) GLCP(2) to identify overlapping functional modules. We compare SLCP(2) and GLCP(2) with a range of state-of-the-art algorithms on synthetic networks and real-world PPI networks. The performance evaluation based on several criteria with respect to protein complex prediction, high level Gene Ontology term prediction and especially sparse module detection, has demonstrated that our algorithms based on searching for LCP(2) outperform all other compared algorithms.Availability and implementationAll data and code are available at http://www.cse.usf.edu/~xqian/fmi/slcp2hop/.
| S-EPMC3924044 | biostudies-literature
Project description:BackgroundProtein interaction networks (PINs) specific within a particular context contain crucial information regarding many cellular biological processes. For example, PINs may include information on the type and directionality of interaction (e.g. phosphorylation), location of interaction (i.e. tissues, cells), and related diseases. Currently, very few tools are capable of deriving context-specific PINs for conducting exploratory analysis.ResultsWe developed a literature-based online system, Context-specific Protein Network Miner (CPNM), which derives context-specific PINs in real-time from the PubMed database based on a set of user-input keywords and enhanced PubMed query system. CPNM reports enriched information on protein interactions (with type and directionality), their network topology with summary statistics (e.g. most densely connected proteins in the network; most densely connected protein-pairs; and proteins connected by most inbound/outbound links) that can be explored via a user-friendly interface. Some of the novel features of the CPNM system include PIN generation, ontology-based PubMed query enhancement, real-time, user-queried, up-to-date PubMed document processing, and prediction of PIN directionality.ConclusionsCPNM provides a tool for biologists to explore PINs. It is freely accessible at http://www.biotextminer.com/CPNM/.
| S-EPMC3321019 | biostudies-literature
Project description:Protein-protein interaction (PPI) networks carry vital information about proteins' functions. Analysis of PPI networks associated with specific disease systems including cancer helps us in the understanding of the complex biology of diseases. Specifically, identification of similar and frequently occurring patterns (network motifs) across PPI networks will provide useful clues to better understand the biology of the diseases.In this study, we developed a novel pattern-mining algorithm that detects cancer associated functional subgraphs occurring in multiple cancer PPI networks. We constructed nine cancer PPI networks using differentially expressed genes from the Oncomine dataset. From these networks we discovered frequent patterns that occur in all networks and at different size levels. Patterns are abstracted subgraphs with their nodes replaced by node cluster IDs. By using effective canonical labeling and adopting weighted adjacency matrices, we are able to perform graph isomorphism test in polynomial running time. We use a bottom-up pattern growth approach to search for patterns, which allows us to effectively reduce the search space as pattern sizes grow. Validation of the frequent common patterns using GO semantic similarity showed that the discovered subgraphs scored consistently higher than the randomly generated subgraphs at each size level. We further investigated the cancer relevance of a select set of subgraphs using literature-based evidences.Frequent common patterns exist in cancer PPI networks, which can be found through effective pattern mining algorithms. We believe that this work would allow us to identify functionally relevant and coherent subgraphs in cancer networks, which can be advanced to experimental validation to further our understanding of the complex biology of cancer.
| S-EPMC3524085 | biostudies-other
Project description:Protein interaction networks are a promising type of data for studying complex biological systems. However, despite the rich information embedded in these networks, these networks face important data quality challenges of noise and incompleteness that adversely affect the results obtained from their analysis. Here, we apply a robust measure of local network structure called common neighborhood similarity (CNS) to address these challenges. Although several CNS measures have been proposed in the literature, an understanding of their relative efficacies for the analysis of interaction networks has been lacking. We follow the framework of graph transformation to convert the given interaction network into a transformed network corresponding to a variety of CNS measures evaluated. The effectiveness of each measure is then estimated by comparing the quality of protein function predictions obtained from its corresponding transformed network with those from the original network. Using a large set of human and fly protein interactions, and a set of over 100 GO terms for both, we find that several of the transformed networks produce more accurate predictions than those obtained from the original network. In particular, the HC.cont measure and other continuous CNS measures perform well this task, especially for large networks. Further investigation reveals that the two major factors contributing to this improvement are the abilities of CNS measures to prune out noisy edges and enhance functional coherence in the transformed networks.
| S-EPMC4183583 | biostudies-literature
Project description:MotivationThe availability of large-scale curated protein interaction datasets has given rise to the opportunity to investigate higher level organization and modularity within the protein-protein interaction (PPI) network using graph theoretic analysis. Despite the recent progress, systems level analysis of high-throughput PPIs remains a daunting task because of the amount of data they present. In this article, we propose a novel PPI network decomposition algorithm called FACETS in order to make sense of the deluge of interaction data using Gene Ontology (GO) annotations. FACETS finds not just a single functional decomposition of the PPI network, but a multi-faceted atlas of functional decompositions that portray alternative perspectives of the functional landscape of the underlying PPI network. Each facet in the atlas represents a distinct interpretation of how the network can be functionally decomposed and organized. Our algorithm maximizes interpretative value of the atlas by optimizing inter-facet orthogonality and intra-facet cluster modularity.ResultsWe tested our algorithm on the global networks from IntAct, and compared it with gold standard datasets from MIPS and KEGG. We demonstrated the performance of FACETS. We also performed a case study that illustrates the utility of our approach.Supplementary informationSupplementary data are available at the Bioinformatics online.AvailabilityOur software is available freely for non-commercial purposes from: http://www.cais.ntu.edu.sg/~assourav/Facets/
| S-EPMC3467740 | biostudies-literature
Project description:A large-scale molecular interaction network of protein-protein interactions (PPIs) enables the automatic detection of molecular functional modules through a computational approach. However, the functional modules that are typically detected by topological community detection algorithms may be diverse in functional homogeneity and are empirically considered to be default functional modules. Thus, a significant challenge that has been described but not elucidated is investigating the relationship between topological modules and functional modules. We systematically investigated this issue by initially using seven widely used community detection algorithms to partition the PPI network into communities. Four homogeneity measures were subsequently implemented to evaluate the functional homogeneity of protein community. We determined that a significant portion of topological modules with heterogeneous functionality exists and should be further investigated; moreover, these findings indicated that topologically based functional module detection approaches must be reconsidered. Furthermore, we found that the functional homogeneity of topological modules is positively correlated with their edge densities, degree of association with diseases and general Gene Ontology (GO) terms. Thus, topologically based module detection approaches should be used with caution in the identification of functional modules with high homogeneity.
| S-EPMC5701033 | biostudies-literature
Project description:Among other effects, post-translational modifications (PTMs) have been shown to exert their function via the modulation of protein-protein interactions. For twelve different main PTM-types and associated subtypes and across 9 diverse species, we investigated whether particular PTM-types are associated with proteins with specific and possibly "strategic" placements in the network of all protein interactions by determining informative network-theoretic properties. Proteins undergoing a PTM were observed to engage in more interactions and positioned in more central locations than non-PTM proteins. Among the twelve considered PTM-types, phosphorylated proteins were identified most consistently as being situated in central network locations and with the broadest interaction spectrum to proteins carrying other PTM-types, while glycosylated proteins are preferentially located at the network periphery. For the human interactome, proteins undergoing sumoylation or proteolytic cleavage were found with the most characteristic network properties. PTM-type-specific protein interaction network (PIN) properties can be rationalized with regard to the function of the respective PTM-carrying proteins. For example, glycosylation sites were found enriched in proteins with plasma membrane localizations and transporter or receptor activity, which generally have fewer interacting partners. The involvement in disease processes of human proteins undergoing PTMs was also found associated with characteristic PIN properties. By integrating global protein interaction networks and specific PTMs, our study offers a novel approach to unraveling the role of PTMs in cellular processes.
| S-EPMC4333291 | biostudies-literature
Project description:Understanding signaling and other complex biological processes requires elucidating the critical roles of intrinsically disordered proteins (IDPs) and regions (IDRs), which represent ∼30% of the proteome and enable unique regulatory mechanisms. In this review, we describe the structural heterogeneity of disordered proteins that underpins these mechanisms and the latest progress in obtaining structural descriptions of conformational ensembles of disordered proteins that are needed for linking structure and dynamics to function. We describe the diverse interactions of IDPs that can have unusual characteristics such as "ultrasensitivity" and "regulated folding and unfolding". We also summarize the mounting data showing that large-scale assembly and protein phase separation occurs within a variety of signaling complexes and cellular structures. In addition, we discuss efforts to therapeutically target disordered proteins with small molecules. Overall, we interpret the remodeling of disordered state ensembles due to binding and post-translational modifications within an expanded framework for allostery that provides significant insights into how disordered proteins transmit biological information.
| S-EPMC5342629 | biostudies-literature
Project description:RNAs interact with networks of proteins to form complexes (RNPs) that govern many biological processes, but inter-protein networks on RNA are currently impossible to examine in a comprehensive way. We developed a live-cell RNP-MaP (RNP network analysis by mutational profiling) chemical probing strategy for mapping simultaneous binding by and cooperative interactions among multiple proteins with single RNA molecules at nucleotide resolution. RNP-MaP revealed that two structurally related, but sequence-divergent noncoding RNAs, RNase P and RMRP, share nearly identical RNP networks and, further, that protein-mediated structural communication identifies function-critical network hubs in these RNAs. RNP-MaP identified previously unknown protein interaction networks within the XIST long noncoding RNA that are conserved between mouse and human RNAs and defined silencing, compartmentalization and splicing communities of proteins whose binding sites are networked together on XIST. The XIST E region contains a dense network of protein interactions, and including PTBP1, MATR3, and TIA1 proteins , which RNP-MaP revealed to each bind the XIST E region via two distinct interaction modes.; Depletion of PTBP1 and MATR3 caused native XIST particles to disperse and disappear in a human cell line. the The highly networked XIST E region was sufficient to mediate XIST RNA-like foci formation in cells. RNP-MaP enables discovery and prioritization of in-cell protein interaction networks critical for function in long RNAs, in the absence of pre-existing knowledge about protein binding sites.
2020-07-05 | GSE152483 | GEO