scholarly journals 3D spatial organization and network-guided comparison of mutation profiles in Glioblastoma reveals similarities across patients

2019 ◽  
Author(s):  
Cansu Dincer ◽  
Tugba Kaya ◽  
Ozlem Keskin ◽  
Attila Gursoy ◽  
Nurcan Tuncbag

AbstractMutation profiles of Glioblastoma (GBM) tumors are very heterogeneous which is the main challenge in the interpretation of the effects of mutations in disease. Additionally, the impact of the mutations is not uniform across the proteins and protein-protein interactions. The pathway level representation of the mutations is very limited. In this work, we approach these challenges through a systems level perspective in which we analyze how the mutations in GBM tumors are distributed in protein structures/interfaces and how they are organized at the network level. Our results show that out of 14644 mutations, 4392 have structural information and ~13% of them form spatial patches. Despite a small portion of all mutations, 3D patches partially decrease the heterogeneity across the patients. Hub proteins adapt multiple patches of mutations usually with a very large one and connects mutations in multiple binding sites through the core of the protein. We reconstructed patient specific networks for 290 GBM tumors. Network-guided analysis of mutations completes the interaction components that mutated proteins potentially affect, and groups the patients according to the reconstructed networks. As a result, we found 4 tumor clusters that overcome the heterogeneity in mutation profiles, and reveal predominant pathways in each group. Additionally, the network-based similarity analysis shows that each group of patients carries a set of signature 3D mutation patches. We believe that this study provides another perspective to the analysis of mutation effects and a good training towards the network-guided precision medicine.Author SummaryGlioblastoma (GBM) is the most aggressive brain tumor type with a 15 months of survival on average. The mutation distribution of the GBM patients is very heterogeneous and standard treatments fail to consider the inter-tumor heterogeneity. In our study, we follow a systems level approach that integrates mutation profiles with protein-protein interaction networks. We hypothesized that although the mutations are heterogeneous, the mutations that are close in 3D of the same protein may affect the protein function similarly and this information can be used to get meaningful relation between disease state and mutations. Therefore, we spatially grouped these mutations as “patches” and reconstructed patient specific protein interaction networks. When we cluster these networks based on their pathway similarities, we found four patient groups in GBM. Then, the comparison of groups revealed overrepresentation of 3D patches. This finding can be used for patient specific therapy.

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Bradley A. Maron ◽  
Rui-Sheng Wang ◽  
Sergei Shevtsov ◽  
Stavros G. Drakos ◽  
Elena Arons ◽  
...  

AbstractProgress in precision medicine is limited by insufficient knowledge of transcriptomic or proteomic features in involved tissues that define pathobiological differences between patients. Here, myectomy tissue from patients with obstructive hypertrophic cardiomyopathy and heart failure is analyzed using RNA-Seq, and the results are used to develop individualized protein-protein interaction networks. From this approach, hypertrophic cardiomyopathy is distinguished from dilated cardiomyopathy based on the protein-protein interaction network pattern. Within the hypertrophic cardiomyopathy cohort, the patient-specific networks are variable in complexity, and enriched for 30 endophenotypes. The cardiac Janus kinase 2-Signal Transducer and Activator of Transcription 3-collagen 4A2 (JAK2-STAT3-COL4A2) expression profile informed by the networks was able to discriminate two hypertrophic cardiomyopathy patients with extreme fibrosis phenotypes. Patient-specific network features also associate with other important hypertrophic cardiomyopathy clinical phenotypes. These proof-of-concept findings introduce personalized protein-protein interaction networks (reticulotypes) for characterizing patient-specific pathobiology, thereby offering a direct strategy for advancing precision medicine.


2017 ◽  
Author(s):  
Minoo Ashtiani ◽  
Ali Salehzadeh-Yazdi ◽  
Zahra Razaghi-Moghadam ◽  
Holger Hennig ◽  
Olaf Wolkenhauer ◽  
...  

AbstractBackgroundNumerous centrality measures have been introduced to identify “central” nodes in large networks. The availability of a wide range of measures for ranking influential nodes leaves the user to decide which measure may best suit the analysis of a given network. The choice of a suitable measure is furthermore complicated by the impact of the network topology on ranking influential nodes by centrality measures. To approach this problem systematically, we examined the centrality profile of nodes of yeast protein-protein interaction networks (PPINs) in order to detect which centrality measure is succeeding in predicting influential proteins. We studied how different topological network features are reflected in a large set of commonly used centrality measures.ResultsWe used yeast PPINs to compare 27 common of centrality measures. The measures characterize and assort influential nodes of the networks. We applied principal component analysis (PCA) and hierarchical clustering and found that the most informative measures depend on the network’s topology. Interestingly, some measures had a high level of contribution in comparison to others in all PPINs, namely Latora closeness, Decay, Lin, Freeman closeness, Diffusion, Residual closeness and Average distance centralities.ConclusionsThe choice of a suitable set of centrality measures is crucial for inferring important functional properties of a network. We concluded that undertaking data reduction using unsupervised machine learning methods helps to choose appropriate variables (centrality measures). Hence, we proposed identifying the contribution proportions of the centrality measures with PCA as a prerequisite step of network analysis before inferring functional consequences, e.g., essentiality of a node.


2018 ◽  
Vol 439 ◽  
pp. 141-151 ◽  
Author(s):  
Xiaoxia Liu ◽  
Zhihao Yang ◽  
Ziwei Zhou ◽  
Yuanyuan Sun ◽  
Hongfei Lin ◽  
...  

2020 ◽  
pp. mcp.RA120.002275
Author(s):  
R. Greg Stacey ◽  
Michael A. Skinnider ◽  
Leonard J. Foster

Biological functions emerge from complex and dynamic networks of protein-protein interactions. Because these protein-protein interaction networks, or interactomes, represent pairwise connections within a hierarchically organized system, it is often useful to identify higher-order associations embedded within them, such as multi-member protein complexes. Graph-based clustering techniques are widely used to accomplish this goal, and dozens of field-specific and general clustering algorithms exist. However, interactomes can be prone to errors, especially when inferred from high-throughput biochemical assays. Therefore, robustness to network-level noise is an important criterion for any clustering algorithm that aims to generate robust, reproducible clusters. Here, we tested the robustness of a range of graph-based clustering algorithms in the presence of noise, including algorithms common across domains and those specific to protein networks. Strikingly, we found that all of the clustering algorithms tested here markedly amplified noise within the underlying protein interaction network. Randomly rewiring only 1% of network edges yielded more than a 50% change in clustering results, indicating that clustering markedly amplified network-level noise. Moreover, we found the impact of network noise on individual clusters was not uniform: some clusters were consistently robust to injected noise while others were not. To assist in assessing this, we developed the clust.perturb R package and Shiny web application to measure the reproducibility of clusters by randomly perturbing the network. We show that clust.perturb results are predictive of real-world cluster stability: poorly reproducible clusters as identified by clust.perturb are significantly less likely to be reclustered across experiments. We conclude that graph-based clustering amplifies noise in protein interaction networks, but quantifying the robustness of a cluster to network noise can separate stable protein complexes from spurious associations.


Sign in / Sign up

Export Citation Format

Share Document