scholarly journals Protein Complex Discovery by Interaction Filtering from Protein Interaction Networks Using Mutual Rank Coexpression and Sequence Similarity

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Ali Kazemi-Pour ◽  
Bahram Goliaei ◽  
Hamid Pezeshk

The evaluation of the biological networks is considered the essential key to understanding the complex biological systems. Meanwhile, the graph clustering algorithms are mostly used in the protein-protein interaction (PPI) network analysis. The complexes introduced by the clustering algorithms include noise proteins. The error rate of the noise proteins in the PPI network researches is about 40–90%. However, only 30–40% of the existing interactions in the PPI databases depend on the specific biological function. It is essential to eliminate the noise proteins and the interactions from the complexes created via clustering methods. We have introduced new methods of weighting interactions in protein clusters and the splicing of noise interactions and proteins-based interactions on their weights. The coexpression and the sequence similarity of each pair of proteins are considered the edge weight of the proteins in the network. The results showed that the edge filtering based on the amount of coexpression acts similar to the node filtering via graph-based characteristics. Regarding the removal of the noise edges, the edge filtering has a significant advantage over the graph-based method. The edge filtering based on the amount of sequence similarity has the ability to remove the noise proteins and the noise interactions.

2010 ◽  
Vol 08 (06) ◽  
pp. 929-943 ◽  
Author(s):  
NASSIM SOHAEE ◽  
CHRISTIAN V. FORST

Dense subgraphs of Protein–Protein Interaction (PPI) graphs are assumed to be potential functional modules and play an important role in inferring the functional behavior of proteins. Increasing amount of available PPI data implies a fast, accurate approach of biological complex identification. Therefore, there are different models and algorithms in identifying functional modules. This paper describes a new graph theoretic clustering algorithm that detects densely connected regions in a large PPI graph. The method is based on finding bounded diameter subgraphs around a seed node. The algorithm has the advantage of being very simple and efficient when compared with other graph clustering methods. This algorithm is tested on the yeast PPI graph and the results are compared with MCL, Core-Attachment, and MCODE algorithms.


2020 ◽  
Vol 27 (4) ◽  
pp. 265-278 ◽  
Author(s):  
Ying Han ◽  
Liang Cheng ◽  
Weiju Sun

The interactions among proteins and genes are extremely important for cellular functions. Molecular interactions at protein or gene levels can be used to construct interaction networks in which the interacting species are categorized based on direct interactions or functional similarities. Compared with the limited experimental techniques, various computational tools make it possible to analyze, filter, and combine the interaction data to get comprehensive information about the biological pathways. By the efficient way of integrating experimental findings in discovering PPIs and computational techniques for prediction, the researchers have been able to gain many valuable data on PPIs, including some advanced databases. Moreover, many useful tools and visualization programs enable the researchers to establish, annotate, and analyze biological networks. We here review and list the computational methods, databases, and tools for protein−protein interaction prediction.


2017 ◽  
Vol 18 (1) ◽  
pp. 5-10 ◽  
Author(s):  
Alexiou Athanasios ◽  
Vairaktarakis Charalampos ◽  
Tsiamis Vasileios ◽  
Ghulam Ashraf

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Suthanthiram Backiyarani ◽  
Rajendran Sasikala ◽  
Simeon Sharmiladevi ◽  
Subbaraya Uma

AbstractBanana, one of the most important staple fruit among global consumers is highly sterile owing to natural parthenocarpy. Identification of genetic factors responsible for parthenocarpy would facilitate the conventional breeders to improve the seeded accessions. We have constructed Protein–protein interaction (PPI) network through mining differentially expressed genes and the genes used for transgenic studies with respect to parthenocarpy. Based on the topological and pathway enrichment analysis of proteins in PPI network, 12 candidate genes were shortlisted. By further validating these candidate genes in seeded and seedless accession of Musa spp. we put forward MaAGL8, MaMADS16, MaGH3.8, MaMADS29, MaRGA1, MaEXPA1, MaGID1C, MaHK2 and MaBAM1 as possible target genes in the study of natural parthenocarpy. In contrary, expression profile of MaACLB-2 and MaZEP is anticipated to highlight the difference in artificially induced and natural parthenocarpy. By exploring the PPI of validated genes from the network, we postulated a putative pathway that bring insights into the significance of cytokinin mediated CLAVATA(CLV)–WUSHEL(WUS) signaling pathway in addition to gibberellin mediated auxin signaling in parthenocarpy. Our analysis is the first attempt to identify candidate genes and to hypothesize a putative mechanism that bridges the gaps in understanding natural parthenocarpy through PPI network.


2009 ◽  
Vol 7 (44) ◽  
pp. 423-437 ◽  
Author(s):  
Tijana Milenković ◽  
Vesna Memišević ◽  
Anand K. Ganesan ◽  
Nataša Pržulj

Many real-world phenomena have been described in terms of large networks. Networks have been invaluable models for the understanding of biological systems. Since proteins carry out most biological processes, we focus on analysing protein–protein interaction (PPI) networks. Proteins interact to perform a function. Thus, PPI networks reflect the interconnected nature of biological processes and analysing their structural properties could provide insights into biological function and disease. We have already demonstrated, by using a sensitive graph theoretic method for comparing topologies of node neighbourhoods called ‘graphlet degree signatures’, that proteins with similar surroundings in PPI networks tend to perform the same functions. Here, we explore whether the involvement of genes in cancer suggests the similarity of their topological ‘signatures’ as well. By applying a series of clustering methods to proteins' topological signature similarities, we demonstrate that the obtained clusters are significantly enriched with cancer genes. We apply this methodology to identify novel cancer gene candidates, validating 80 per cent of our predictions in the literature. We also validate predictions biologically by identifying cancer-related negative regulators of melanogenesis identified in our siRNA screen. This is encouraging, since we have done this solely from PPI network topology. We provide clear evidence that PPI network structure around cancer genes is different from the structure around non-cancer genes. Understanding the underlying principles of this phenomenon is an open question, with a potential for increasing our understanding of complex diseases.


2022 ◽  
Vol 12 (3) ◽  
pp. 523-532
Author(s):  
Xin Yan ◽  
Chunfeng Liang ◽  
Xinghuan Liang ◽  
Li Li ◽  
Zhenxing Huang ◽  
...  

<sec> <title>Objective:</title> This study aimed to identify the potential key genes associated with the progression and prognosis of adrenocortical carcinoma (ACC). </sec> <sec> <title>Methods:</title> Differentially expressed genes (DEGs) in ACC cells and normal adrenocortical cells were assessed by microarray from the Gene Expression Omnibus database. The biological functions of the classified DEGs were examined by Gene Ontology (GO) and the Kyoto Encyclopedia of Genes and Genomes pathway (KEGG) enrichment analyses and a protein–protein interaction (PPI) network was mapped using Cytoscape software. MCODE software was also used for the module analysis and then 4 algorithms of cytohubba software were used to screen hub genes. The overall survival (OS) examination of the hub genes was then performed by the ualcan online tool. </sec> <sec> <title>Results:</title> Two GSEs (GSE12368, GSE33371) were downloaded from GEO including 18 and 43 cases, respectively. One hundred and sixty-nine DEGs were identified, including 57 upregulated genes and 112 downregulated genes. The Gene Ontology (GO) analyses showed that the upregulated genes were significantly enriched in the mitotic cytokines is, nucleus and ATP binding, while the downregulated genes were involved in the positive regulation of cardiac muscle contraction, extracellular space, and heparin-binding (P < 0.05). The Kyoto Encyclopedia of Genes and Genomes pathway (KEGG) pathway examination showed significant pathways including the cell cycle and the complement and coagulation cascades. The protein– protein interaction (PPI) network consisted of 162 nodes and 847 edges, including mitotic nuclear division, cytoplasmic, protein kinase binding, and cell cycle. All 4 identified hub genes (FOXM1, UBE2C, KIF11, and NDC80) were associated with the prognosis of adrenocortical carcinoma (ACC) by survival analysis. </sec> <sec> <title>Conclusions:</title> The present study offered insights into the molecular mechanism of adrenocortical carcinoma (ACC) that may be beneficial in further analyses. </sec>


The task of predicting target proteins for new drug discovery is typically difficult. Target proteins are biologically most important to control a keen functional process. The recent research of experimental and computational -based approaches has been widely used to predict target proteins using biological networks analysis techniques. Perhaps with available methods and statistical algorithm needs to be modified and should be clearer to tag the main target. Meanwhile identifying wrong protein leads to unwanted molecular interaction and pharmacological activity. In this research work, a novel method to identify essential target proteins using integrative graph coloring algorithm has been proposed. The proposed integrative approach helps to extract essential proteins in protein-protein interaction network (PPI) by analyzing neighborhood of the active target protein. Experimental results reviewed based on protein-protein interaction network for homosapiens showed that AEIAPP based approach shows an improvement in the essential protein identification by assuming the source protein as biologically proven protein. The AEIAPP statistical model has been compared with other state of art approaches on human PPI for various diseases to produce good accurate outcome in faster manner with little memory consumption.


2021 ◽  
Author(s):  
Zhihong Zhang ◽  
Sai Hu ◽  
Wei Yan ◽  
Bihai Zhao ◽  
Lei Wang

Abstract BackgroundIdentification of essential proteins is very important for understanding the basic requirements to sustain a living organism. In recent years, various different computational methods have been proposed to identify essential proteins based on protein-protein interaction (PPI) networks. However, there has been reliable evidence that a huge amount of false negatives and false positives exist in PPI data. Therefore, it is necessary to reduce the influence of false data on accuracy of essential proteins prediction by integrating multi-source biological information with PPI networks.ResultsIn this paper, we proposed a non-negative matrix factorization and multiple biological information based model (NDM) for identifying essential proteins. The first stage in this progress was to construct a weighted PPI network by combing the information of protein domain, protein complex and the topology characteristic of the original PPI network. Then, the non-negative matrix factorization technique was used to reconstruct an optimized PPI network with whole enough weight of edges. In the final stage, the ranking score of each protein was computed by the PageRank algorithm in which the initial scores were calculated with homologous and subcellular localization information. In order to verify the effectiveness of the NDM method, we compared the NDM with other state-of-the-art essential proteins prediction methods. The comparison of the results obtained from different methods indicated that our NDM model has better performance in predicting essential proteins.ConclusionEmploying the non-negative matrix factorization and integrating multi-source biological data can effectively improve quality of the PPI network, which resulted in the led to optimization of the performance essential proteins identification. This will also provide a new perspective for other prediction based on protein-protein interaction networks.


F1000Research ◽  
2017 ◽  
Vol 6 ◽  
pp. 1969
Author(s):  
Dongmin Jung ◽  
Xijin Ge

Interactions between proteins occur in many, if not most, biological processes. This fact has motivated the development of a variety of experimental methods for the identification of protein-protein interaction (PPI) networks. Leveraging PPI data available STRING database, we use network-based statistical learning methods to infer the putative functions of proteins from the known functions of neighboring proteins on a PPI network. This package identifies such proteins often involved in the same or similar biological functions. The package is freely available at the Bioconductor web site (http://bioconductor.org/packages/PPInfer/).


2021 ◽  
Vol 21 (1) ◽  
Author(s):  
Masoumeh Adhami ◽  
Balal Sadeghi ◽  
Ali Rezapour ◽  
Ali Akbar Haghdoost ◽  
Habib MotieGhader

Abstract Background The coronavirus disease-19 (COVID-19) emerged in Wuhan, China and rapidly spread worldwide. Researchers are trying to find a way to treat this disease as soon as possible. The present study aimed to identify the genes involved in COVID-19 and find a new drug target therapy. Currently, there are no effective drugs targeting SARS-CoV-2, and meanwhile, drug discovery approaches are time-consuming and costly. To address this challenge, this study utilized a network-based drug repurposing strategy to rapidly identify potential drugs targeting SARS-CoV-2. To this end, seven potential drugs were proposed for COVID-19 treatment using protein-protein interaction (PPI) network analysis. First, 524 proteins in humans that have interaction with the SARS-CoV-2 virus were collected, and then the PPI network was reconstructed for these collected proteins. Next, the target miRNAs of the mentioned module genes were separately obtained from the miRWalk 2.0 database because of the important role of miRNAs in biological processes and were reported as an important clue for future analysis. Finally, the list of the drugs targeting module genes was obtained from the DGIDb database, and the drug-gene network was separately reconstructed for the obtained protein modules. Results Based on the network analysis of the PPI network, seven clusters of proteins were specified as the complexes of proteins which are more associated with the SARS-CoV-2 virus. Moreover, seven therapeutic candidate drugs were identified to control gene regulation in COVID-19. PACLITAXEL, as the most potent therapeutic candidate drug and previously mentioned as a therapy for COVID-19, had four gene targets in two different modules. The other six candidate drugs, namely, BORTEZOMIB, CARBOPLATIN, CRIZOTINIB, CYTARABINE, DAUNORUBICIN, and VORINOSTAT, some of which were previously discovered to be efficient against COVID-19, had three gene targets in different modules. Eventually, CARBOPLATIN, CRIZOTINIB, and CYTARABINE drugs were found as novel potential drugs to be investigated as a therapy for COVID-19. Conclusions Our computational strategy for predicting repurposable candidate drugs against COVID-19 provides efficacious and rapid results for therapeutic purposes. However, further experimental analysis and testing such as clinical applicability, toxicity, and experimental validations are required to reach a more accurate and improved treatment. Our proposed complexes of proteins and associated miRNAs, along with discovered candidate drugs might be a starting point for further analysis by other researchers in this urgency of the COVID-19 pandemic.


Sign in / Sign up

Export Citation Format

Share Document