NetSets.js: a JavaScript framework for compositional assessment and comparison of biological networks through Venn-integrated network diagrams

2020 ◽  
Author(s):  
Sunil Nagpal ◽  
Bhusan K Kuntal ◽  
Sharmila S Mande
Keyword(s):  
Protein Interactions ◽  
Biological Networks ◽  
Web Application ◽  
Gene Interaction ◽  
Supplementary Information ◽  
Venn Diagram ◽  
Protein Protein Interactions ◽  
Integrated Network ◽  
Network Diagram ◽  
Network Diagrams

Abstract Motivation Venn diagrams are frequently used to compare composition of datasets (e.g. datasets containing list of proteins and genes). Network diagram constructed using such datasets are usually generated using ‘list of edges’, popularly known as edge-lists. An edge-list and the corresponding generated network are, however, composed of two elements, namely, edges (e.g. protein–protein interactions) and nodes (e.g. proteins). Researchers often use individual lists of edges and nodes to compare composition of biological networks using existing Venn diagram tools. However, specialized analysis workflows are required for comparison of nodes as well as edges. Apart from this, different tools or graph libraries are needed for visualizing any specific edges of interest (e.g. protein–protein interactions which are present across all networks or are shared between subset of networks or are exclusively present in a selected network). Further, these results are required to be exported in the form of publication worthy network diagram(s), particularly for small networks. Results We introduce a (server independent) JavaScript framework (called NetSets.js) that integrates popular Venn and network diagrams in a single application. A free to use intuitive web application (utilizing NetSets.js), specifically designed to perform both compositional comparisons (e.g. for identifying common/exclusive edges or nodes) and interactive user defined visualizations of network (for the identified common/exclusive interactions across multiple networks) using simple edge-lists is also presented. The tool also enables connection to Cytoscape desktop application using the Netsets-Cyapp. We demonstrate the utility of our tool using real world biological networks (microbiome, gene interaction, multiplex and protein–protein interaction networks). Availabilityand implementation http://web.rniapps.net/netsets (freely available for academic use). Supplementary information Supplementary data are available at Bioinformatics online.

PPaxe: easy extraction of protein occurrence and interactions from the scientific literature

2018 ◽  
Vol 35 (14) ◽  
pp. 2523-2524 ◽  
Author(s):  
S Castillo-Lara ◽  
J F Abril
Keyword(s):  
Protein Interactions ◽  
Web Application ◽  
Scientific Literature ◽  
Supplementary Information ◽  
Command Line ◽  
Biological Processes ◽  
Supplementary Data ◽  
Protein Protein Interactions ◽  
Command Line Version

Abstract Motivation Protein–protein interactions (PPIs) are very important to build models for understanding many biological processes. Although several databases hold many of these interactions, exploring them, selecting those relevant for a given subject and contextualizing them can be a difficult task for researchers. Extracting PPIs directly from the scientific literature can be very helpful for providing such context, as the sentences describing these interactions may give insights to researchers in helpful ways. Results We have developed PPaxe, a python module and a web application that allows users to extract PPIs and protein occurrence from a given set of PubMed and PubMedCentral articles. It presents the results of the analysis in different ways to help researchers export, filter and analyze the results easily. Availability and implementation PPaxe web demo is freely available at https://compgen.bio.ub.edu/PPaxe. All the software can be downloaded from https://compgen.bio.ub.edu/PPaxe/download, including a command-line version and docker containers for an easy installation. Supplementary information Supplementary data are available at Bioinformatics online.

Algorithmic and Stochastic Representations of Gene Regulatory Networks and Protein-Protein Interactions

2019 ◽  
Vol 19 (6) ◽  
pp. 413-425 ◽  
Author(s):  
Athanasios Alexiou ◽  
Stylianos Chatzichronis ◽  
Asma Perveen ◽  
Abdul Hafeez ◽  
Ghulam Md. Ashraf
Keyword(s):  
Protein Interactions ◽  
Biological Networks ◽  
Regulatory Networks ◽  
Review Paper ◽  
Boolean Networks ◽  
Diagnostic Tools ◽  
Complex Nature ◽  
Cellular Interactions ◽  
Protein Protein Interactions ◽  
Deterministic Models

Background:Latest studies reveal the importance of Protein-Protein interactions on physiologic functions and biological structures. Several stochastic and algorithmic methods have been published until now, for the modeling of the complex nature of the biological systems.Objective:Biological Networks computational modeling is still a challenging task. The formulation of the complex cellular interactions is a research field of great interest. In this review paper, several computational methods for the modeling of GRN and PPI are presented analytically.Methods:Several well-known GRN and PPI models are presented and discussed in this review study such as: Graphs representation, Boolean Networks, Generalized Logical Networks, Bayesian Networks, Relevance Networks, Graphical Gaussian models, Weight Matrices, Reverse Engineering Approach, Evolutionary Algorithms, Forward Modeling Approach, Deterministic models, Static models, Hybrid models, Stochastic models, Petri Nets, BioAmbients calculus and Differential Equations.Results:GRN and PPI methods have been already applied in various clinical processes with potential positive results, establishing promising diagnostic tools.Conclusion:In literature many stochastic algorithms are focused in the simulation, analysis and visualization of the various biological networks and their dynamics interactions, which are referred and described in depth in this review paper.

scholarly journals Comorbidities and Susceptibility to COVID-19: A Generalized Gene Set Data Mining Approach

2021 ◽  
Vol 10 (8) ◽  
pp. 1666
Author(s):  
Micaela F. Beckman ◽  
Farah Bahrani Mougeot ◽  
Jean-Luc C. Mougeot
Keyword(s):  
Protein Interactions ◽  
Association Studies ◽  
Meta Analysis ◽  
Holistic Approach ◽  
Gene Interaction ◽  
Snp Analysis ◽  
Genome Wide Association Studies ◽  
Nucleotide Polymorphisms ◽  
Protein Protein Interactions ◽  
Data Mining Approach

The COVID-19 pandemic has led to over 2.26 million deaths for almost 104 million confirmed cases worldwide, as of 4 February 2021 (WHO). Risk factors include pre-existing conditions such as cancer, cardiovascular disease, diabetes, and obesity. Although several vaccines have been deployed, there are few alternative anti-viral treatments available in the case of reduced or non-existent vaccine protection. Adopting a long-term holistic approach to cope with the COVID-19 pandemic appears critical with the emergence of novel and more infectious SARS-CoV-2 variants. Our objective was to identify comorbidity-associated single nucleotide polymorphisms (SNPs), potentially conferring increased susceptibility to SARS-CoV-2 infection using a computational meta-analysis approach. SNP datasets were downloaded from a publicly available genome-wide association studies (GWAS) catalog for 141 of 258 candidate COVID-19 comorbidities. Gene-level SNP analysis was performed to identify significant pathways by using the program MAGMA. An SNP annotation program was used to analyze MAGMA-identified genes. Differential gene expression was determined for significant genes across 30 general tissue types using the Functional and Annotation Mapping of GWAS online tool GENE2FUNC. COVID-19 comorbidities (n = 22) from six disease categories were found to have significant associated pathways, validated by Q–Q plots (p < 0.05). Protein–protein interactions of significant (p < 0.05) differentially expressed genes were visualized with the STRING program. Gene interaction networks were found to be relevant to SARS and influenza pathogenesis. In conclusion, we were able to identify the pathways potentially affected by or affecting SARS-CoV-2 infection in underlying medical conditions likely to confer susceptibility and/or the severity of COVID-19. Our findings have implications in future COVID-19 experimental research and treatment development.

Structure-aware protein–protein interaction site prediction using deep graph convolutional network

2021 ◽  
Author(s):  
Qianmu Yuan ◽  
Jianwen Chen ◽  
Huiying Zhao ◽  
Yaoqi Zhou ◽  
Yuedong Yang
Keyword(s):  
Protein Interactions ◽  
Spatial Information ◽  
Screening Tools ◽  
Supplementary Information ◽  
Protein Protein Interactions ◽  
Convolutional Network ◽  
Source Codes ◽  
Site Prediction ◽  
Protein Protein Interaction ◽  
Mapping Techniques

Abstract Motivation Protein–protein interactions (PPI) play crucial roles in many biological processes, and identifying PPI sites is an important step for mechanistic understanding of diseases and design of novel drugs. Since experimental approaches for PPI site identification are expensive and time-consuming, many computational methods have been developed as screening tools. However, these methods are mostly based on neighbored features in sequence, and thus limited to capture spatial information. Results We propose a deep graph-based framework deep Graph convolutional network for Protein–Protein-Interacting Site prediction (GraphPPIS) for PPI site prediction, where the PPI site prediction problem was converted into a graph node classification task and solved by deep learning using the initial residual and identity mapping techniques. We showed that a deeper architecture (up to eight layers) allows significant performance improvement over other sequence-based and structure-based methods by more than 12.5% and 10.5% on AUPRC and MCC, respectively. Further analyses indicated that the predicted interacting sites by GraphPPIS are more spatially clustered and closer to the native ones even when false-positive predictions are made. The results highlight the importance of capturing spatially neighboring residues for interacting site prediction. Availability and implementation The datasets, the pre-computed features, and the source codes along with the pre-trained models of GraphPPIS are available at https://github.com/biomed-AI/GraphPPIS. The GraphPPIS web server is freely available at https://biomed.nscc-gz.cn/apps/GraphPPIS. Supplementary information Supplementary data are available at Bioinformatics online.

Protein Interactions for Functional Genomics

2012 ◽  
Vol 3 (4) ◽  
pp. 15-30
Author(s):  
Pablo Minguez ◽  
Joaquin Dopazo
Keyword(s):  
Graph Theory ◽  
Protein Interactions ◽  
Biological Networks ◽  
State Of The Art ◽  
Protein Protein Interactions ◽  
Pairwise Interactions ◽  
Novel Approach ◽  
Functional Profiling ◽  
Available Resources

Here the authors review the state of the art in the use of protein-protein interactions (ppis) within the context of the interpretation of genomic experiments. They report the available resources and methodologies used to create a curated compilation of ppis introducing a novel approach to filter interactions. Special attention is paid in the complexity of the topology of the networks formed by proteins (nodes) and pairwise interactions (edges). These networks can be studied using graph theory and a brief introduction to the characterization of biological networks and definitions of the more used network parameters is also given. Also a report on the available resources to perform different modes of functional profiling using ppi data is provided along with a discussion on the approaches that have typically been applied into this context. They also introduce a novel methodology for the evaluation of networks and some examples of its application.

scholarly journals Coevolution-based prediction of protein–protein interactions in polyketide biosynthetic assembly lines

2020 ◽  
Vol 36 (19) ◽  
pp. 4846-4853 ◽  
Author(s):  
Yan Wang ◽  
Miguel Correa Marrero ◽  
Marnix H Medema ◽  
Aalt D J van Dijk
Keyword(s):  
Protein Interactions ◽  
Antitumor Agents ◽  
Acyl Carrier Protein ◽  
Specific Protein ◽  
Combinatorial Biosynthesis ◽  
Supplementary Information ◽  
Protein Protein Interactions ◽  
Assembly Lines ◽  
Specific Order ◽  
Encoding Genes

Abstract Motivation Polyketide synthases (PKSs) are enzymes that generate diverse molecules of great pharmaceutical importance, including a range of clinically used antimicrobials and antitumor agents. Many polyketides are synthesized by cis-AT modular PKSs, which are organized in assembly lines, in which multiple enzymes line up in a specific order. This order is defined by specific protein–protein interactions (PPIs). The unique modular structure and catalyzing mechanism of these assembly lines makes their products predictable and also spurred combinatorial biosynthesis studies to produce novel polyketides using synthetic biology. However, predicting the interactions of PKSs, and thereby inferring the order of their assembly line, is still challenging, especially for cases in which this order is not reflected by the ordering of the PKS-encoding genes in the genome. Results Here, we introduce PKSpop, which uses a coevolution-based PPI algorithm to infer protein order in PKS assembly lines. Our method accurately predicts protein orders (93% accuracy). Additionally, we identify new residue pairs that are key in determining interaction specificity, and show that coevolution of N- and C-terminal docking domains of PKSs is significantly more predictive for PPIs than coevolution between ketosynthase and acyl carrier protein domains. Availability and implementation The code is available on http://www.bif.wur.nl/ (under ‘Software’). Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals SeRenDIP: SEquential REmasteriNg to DerIve profiles for fast and accurate predictions of PPI interface positions

2019 ◽  
Vol 35 (22) ◽  
pp. 4794-4796 ◽  
Author(s):  
Qingzhen Hou ◽  
Paul F G De Geest ◽  
Christian J Griffioen ◽  
Sanne Abeln ◽  
Jaap Heringa ◽  
...  
Keyword(s):  
Protein Interaction ◽  
Protein Interactions ◽  
Sequence Data ◽  
Supplementary Information ◽  
Protein Protein Interactions ◽  
Interaction Sites ◽  
Expert User ◽  
Interaction Interface ◽  
Experimental Annotation ◽  
Protein Sequence Data

Abstract Motivation Interpretation of ubiquitous protein sequence data has become a bottleneck in biomolecular research, due to a lack of structural and other experimental annotation data for these proteins. Prediction of protein interaction sites from sequence may be a viable substitute. We therefore recently developed a sequence-based random forest method for protein–protein interface prediction, which yielded a significantly increased performance than other methods on both homomeric and heteromeric protein–protein interactions. Here, we present a webserver that implements this method efficiently. Results With the aim of accelerating our previous approach, we obtained sequence conservation profiles by re-mastering the alignment of homologous sequences found by PSI-BLAST. This yielded a more than 10-fold speedup and at least the same accuracy, as reported previously for our method; these results allowed us to offer the method as a webserver. The web-server interface is targeted to the non-expert user. The input is simply a sequence of the protein of interest, and the output a table with scores indicating the likelihood of having an interaction interface at a certain position. As the method is sequence-based and not sensitive to the type of protein interaction, we expect this webserver to be of interest to many biological researchers in academia and in industry. Availability and implementation Webserver, source code and datasets are available at www.ibi.vu.nl/programs/serendipwww/. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Handling Noise in Protein Interaction Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Fernanda B. Correia ◽  
Edgar D. Coelho ◽  
José L. Oliveira ◽  
Joel P. Arrais
Keyword(s):  
Network Topology ◽  
Protein Interactions ◽  
Biological Networks ◽  
Homo Sapiens ◽  
Random Networks ◽  
Protein Protein Interactions ◽  
Ppi Networks ◽  
Reference Set ◽  
Human Networks ◽  
Random Removal

Protein-protein interactions (PPIs) can be conveniently represented as networks, allowing the use of graph theory for their study. Network topology studies may reveal patterns associated with specific organisms. Here, we propose a new methodology to denoise PPI networks and predict missing links solely based on the network topology, the organization measurement (OM) method. The OM methodology was applied in the denoising of the PPI networks of two Saccharomyces cerevisiae datasets (Yeast and CS2007) and one Homo sapiens dataset (Human). To evaluate the denoising capabilities of the OM methodology, two strategies were applied. The first strategy compared its application in random networks and in the reference set networks, while the second strategy perturbed the networks with the gradual random addition and removal of edges. The application of the OM methodology to the Yeast and Human reference sets achieved an AUC of 0.95 and 0.87, in Yeast and Human networks, respectively. The random removal of 80% of the Yeast and Human reference set interactions resulted in an AUC of 0.71 and 0.62, whereas the random addition of 80% interactions resulted in an AUC of 0.75 and 0.72, respectively. Applying the OM methodology to the CS2007 dataset yields an AUC of 0.99. We also perturbed the network of the CS2007 dataset by randomly inserting and removing edges in the same proportions previously described. The false positives identified and removed from the network varied from 97%, when inserting 20% more edges, to 89%, when 80% more edges were inserted. The true positives identified and inserted in the network varied from 95%, when removing 20% of the edges, to 40%, after the random deletion of 80% edges. The OM methodology is sensitive to the topological structure of the biological networks. The obtained results suggest that the present approach can efficiently be used to denoise PPI networks.

Protein–protein interaction site prediction through combining local and global features with deep neural networks

2019 ◽  
Author(s):  
Min Zeng ◽  
Fuhao Zhang ◽  
Fang-Xiang Wu ◽  
Yaohang Li ◽  
Jianxin Wang ◽  
...  
Keyword(s):  
Deep Learning ◽  
Protein Interactions ◽  
Supplementary Information ◽  
Protein Protein Interactions ◽  
Global Features ◽  
Site Prediction ◽  
Sequence Features ◽  
Protein Protein Interaction ◽  
Contextual Features ◽  
Interaction Site Prediction

Abstract Motivation Protein–protein interactions (PPIs) play important roles in many biological processes. Conventional biological experiments for identifying PPI sites are costly and time-consuming. Thus, many computational approaches have been proposed to predict PPI sites. Existing computational methods usually use local contextual features to predict PPI sites. Actually, global features of protein sequences are critical for PPI site prediction. Results A new end-to-end deep learning framework, named DeepPPISP, through combining local contextual and global sequence features, is proposed for PPI site prediction. For local contextual features, we use a sliding window to capture features of neighbors of a target amino acid as in previous studies. For global sequence features, a text convolutional neural network is applied to extract features from the whole protein sequence. Then the local contextual and global sequence features are combined to predict PPI sites. By integrating local contextual and global sequence features, DeepPPISP achieves the state-of-the-art performance, which is better than the other competing methods. In order to investigate if global sequence features are helpful in our deep learning model, we remove or change some components in DeepPPISP. Detailed analyses show that global sequence features play important roles in DeepPPISP. Availability and implementation The DeepPPISP web server is available at http://bioinformatics.csu.edu.cn/PPISP/. The source code can be obtained from https://github.com/CSUBioGroup/DeepPPISP. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals AutoDock CrankPep: combining folding and docking to predict protein–peptide complexes

2019 ◽  
Vol 35 (24) ◽  
pp. 5121-5127 ◽  
Author(s):  
Yuqi Zhang ◽  
Michel F Sanner
Keyword(s):  
Amino Acids ◽  
Protein Interactions ◽  
Disordered Proteins ◽  
Supplementary Information ◽  
Protein Protein Interactions ◽  
Peptide Docking ◽  
Novel Approach ◽  
Peptide Interactions ◽  
Therapeutic Molecules ◽  
Peptide Complexes

Abstract Motivation Protein–peptide interactions mediate a wide variety of cellular and biological functions. Methods for predicting these interactions have garnered a lot of interest over the past few years, as witnessed by the rapidly growing number of peptide-based therapeutic molecules currently in clinical trials. The size and flexibility of peptides has shown to be challenging for existing automated docking software programs. Results Here we present AutoDock CrankPep or ADCP in short, a novel approach to dock flexible peptides into rigid receptors. ADCP folds a peptide in the potential field created by the protein to predict the protein–peptide complex. We show that it outperforms leading peptide docking methods on two protein–peptide datasets commonly used for benchmarking docking methods: LEADS-PEP and peptiDB, comprised of peptides with up to 15 amino acids in length. Beyond these datasets, ADCP reliably docked a set of protein–peptide complexes containing peptides ranging in lengths from 16 to 20 amino acids. The robust performance of ADCP on these longer peptides enables accurate modeling of peptide-mediated protein–protein interactions and interactions with disordered proteins. Availability and implementation ADCP is distributed under the LGPL 2.0 open source license and is available at http://adcp.scripps.edu. The source code is available at https://github.com/ccsb-scripps/ADCP. Supplementary information Supplementary data are available at Bioinformatics online.

Sign in / Sign up

Export Citation Format

Share Document