scholarly journals ModuleDiscoverer: Identification of regulatory modules in protein-protein interaction networks

2017 ◽  
Author(s):  
Sebastian Vlaic ◽  
Christian Tokarski-Schnelle ◽  
Mika Gustafsson ◽  
Uta Dahmen ◽  
Reinhard Guthke ◽  
...  

AbstractThe identification of disease associated modules based on protein-protein interaction networks (PPINs) and gene expression data has provided new insights into the mechanistic nature of diverse diseases. A major problem hampering their identification is the detection of protein communities within large-scale, whole-genome PPINs. Current strategies solve the maximal clique enumeration (MCE) problem, i.e., the enumeration of all non-extendable groups of proteins, where each pair of proteins is connected by an edge. The MCE problem however is non-deterministic polynomial time hard and can thus be computationally overwhelming for large-scale, whole-genome PPINs.We present ModuleDiscoverer, a novel approach for the identification of regulatory modules from PPINs in conjunction with gene-expression data. ModuleDiscoverer is a heuristic that approximates the community structure underlying PPINs. Based on a high-confidence PPIN of Rattus norvegicus and publicly available gene expression data we apply our algorithm to identify the regulatory module of a rat-model of diet induced non-alcoholic steatohepatitis (NASH). We validate the module using single-nucleotide polymorphism data from independent genome-wide association studies. Structural analysis of the module reveals 10 sub-modules. These sub-modules are associated with distinct biological functions and pathways that are relevant to the pathological and clinical situation in NASH.ModuleDiscoverer is freely available upon request from the corresponding author.

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 772
Author(s):  
Seonghun Kim ◽  
Seockhun Bae ◽  
Yinhua Piao ◽  
Kyuri Jo

Genomic profiles of cancer patients such as gene expression have become a major source to predict responses to drugs in the era of personalized medicine. As large-scale drug screening data with cancer cell lines are available, a number of computational methods have been developed for drug response prediction. However, few methods incorporate both gene expression data and the biological network, which can harbor essential information about the underlying process of the drug response. We proposed an analysis framework called DrugGCN for prediction of Drug response using a Graph Convolutional Network (GCN). DrugGCN first generates a gene graph by combining a Protein-Protein Interaction (PPI) network and gene expression data with feature selection of drug-related genes, and the GCN model detects the local features such as subnetworks of genes that contribute to the drug response by localized filtering. We demonstrated the effectiveness of DrugGCN using biological data showing its high prediction accuracy among the competing methods.


2014 ◽  
Vol 30 (17) ◽  
pp. 2527-2528 ◽  
Author(s):  
Ken-Chi Yang ◽  
Chia-Lang Hsu ◽  
Chen-Ching Lin ◽  
Hsueh-Fen Juan ◽  
Hsuan-Cheng Huang

2020 ◽  
Vol 14 ◽  
pp. 117793222090985 ◽  
Author(s):  
Martin C Nwadiugwu

The current study seeks to compare 3 clustering algorithms that can be used in gene-based bioinformatics research to understand disease networks, protein-protein interaction networks, and gene expression data. Denclue, Fuzzy-C, and Balanced Iterative and Clustering using Hierarchies (BIRCH) were the 3 gene-based clustering algorithms selected. These algorithms were explored in relation to the subfield of bioinformatics that analyzes omics data, which include but are not limited to genomics, proteomics, metagenomics, transcriptomics, and metabolomics data. The objective was to compare the efficacy of the 3 algorithms and determine their strength and drawbacks. Result of the review showed that unlike Denclue and Fuzzy-C which are more efficient in handling noisy data, BIRCH can handle data set with outliers and have a better time complexity.


Sign in / Sign up

Export Citation Format

Share Document