Computational approaches to predicting essential proteins: A survey

Putative Pharmacological Depression and Anxiety-Related Targets of Calcitriol Explored by Network Pharmacology and Molecular Docking

Depression and anxiety disorders, prevalent neuropsychiatric conditions that frequently coexist, limit psychosocial functioning and, consequently, the individual's quality of life. Since the pharmacological treatment of these disorders has several limitations, the search for effective and secure antidepressant and anxiolytic compounds is welcome. Vitamin D has been shown to exhibit neuroprotective, antidepressant, and anxiolytic properties. Therefore, this study aimed to explore new molecular targets of calcitriol, the active form of vitamin D, through integrated bioinformatic analysis. Calcitriol targets were predicted in SwissTargetPrediction server (2019 version). The disease targets were collected by the GeneCards database searching the keywords "depression" and "anxiety". Gene ontology (GO) and the Kyoto Encyclopedia of Genes and Genomes (KEGG) were used to analyze the intersections of targets. Network analyses were carried out using GeneMania server (2023 version) and Cytoscape (V. 3.9.1.) software. Molecular docking predicted the main targets of the network and Ligplot predicted the main intermolecular interactions. Our study showed that calcitriol may interact with multiple targets. The main targets found are the vitamin D receptor (VDR), histamine H3 receptor (H3R), endocannabinoid receptors 1 and 2 (CB1 and CB2), nuclear receptor NR1H3, patched-1 (PTCH1) protein, opioid receptor NOP, and phosphodiesterase enzymes PDE3A and PDE5A. Considering the role of these targets in the pathophysiology of depression and anxiety, our findings suggest novel putative mechanisms of action of vitamin D as well as new promising molecular targets whose role in these disorders deserves further investigation.

Recent advances in the characterization of essential genes and development of a database of essential genes

Over the past few decades, there has been a significant interest in the study of essential genes, which are crucial for the survival of an organism under specific environmental conditions and thus have practical applications in the fields of synthetic biology and medicine. An increasing amount of experimental data on essential genes has been obtained with the continuous development of technological methods. Meanwhile, various computational prediction methods, related databases and web servers have emerged accordingly. To facilitate the study of essential genes, we have established a database of essential genes (DEG), which has become popular with continuous updates to facilitate essential gene feature analysis and prediction, drug and vaccine development, as well as artificial genome design and construction. In this article, we summarized the studies of essential genes, overviewed the relevant databases, and discussed their practical applications. Furthermore, we provided an overview of the main applications of DEG and conducted comprehensive analyses based on its latest version. However, it should be noted that the essential gene is a dynamic concept instead of a binary one, which presents both opportunities and challenges for their future development.

Network Pharmacology and In vitro Experimental Verification to Explore the Mechanism of Chaiqin Qingning Capsule in the Treatment of Pain

BACKGROUND

Chaiqin Qingning capsule (CQQNC) has been used to relieve pain in practice. However, the active components, pain targets, and molecular mechanisms for pain control are unclear.

OBJECTIVE

To explore the active components and potential mechanisms of the analgesic effect of CQQNC through network pharmacology and in vitro experiments.

METHODS

The main active components and the corresponding targets of CQQNC were screened from the TCMSP and the SwissTargetPrediction databases. Pain-related targets were selected in the OMIM, Gene- Cards, and DrugBank databases. These targets were intersected to obtain potential analgesic targets. The analgesic targets were imported into the STRING and DAVID databases for protein-protein interaction (PPI), gene ontology (GO) function enrichment and Kyoto Encyclopedia of Genes and Genomes (KEGG) pathway enrichment analyses. Cytoscape software (V3.7.1) was used to construct an active component-intersection network. Finally, the key components were docked with the core targets. The analgesic mechanism of CQQNC was verified by RAW264.7 cell experiment.

RESULTS

30 active CQQNC components, 617 corresponding targets, and 3,214 pain-related target genes were found. The main active components were quercetin, kaempferol, and chenodeoxycholic acid etc. The key targets were ALB, AKT1, TNF, IL6, TP53, IL1B, and SRC. CQQNC can exert an analgesic effect through PI3K-Akt, MAPK signaling pathways, etc. Molecular docking showed that these active components had good binding activities with key targets. The results of in vitro experiments showed that CQQNC could exert antiinflammatory and analgesic effects through MAPK/AKT/NF-kB signaling pathways.

CONCLUSION

CQQNC exerts pain control through inhibiting MAPK/AKT/NF-kB signaling pathways.

Exploring the Molecular Targets for the Antidepressant and Antisuicidal Effects of Ketamine Enantiomers by Using Network Pharmacology and Molecular Docking

Ketamine, a racemic mixture of esketamine (S-ketamine) and arketamine (R-ketamine), has received particular attention for its rapid antidepressant and antisuicidal effects. NMDA receptor inhibition has been indicated as one of the main mechanisms of action of the racemic mixture, but other pharmacological targets have also been proposed. This study aimed to explore the possible multiple targets of ketamine enantiomers related to their antidepressant and antisuicidal effects. To this end, targets were predicted using Swiss Target Prediction software for each ketamine enantiomer. Targets related to depression and suicide were collected by the Gene Cards database. The intersections of targets were analyzed using Gene Ontology (GO) and Kyoto Encyclopedia of Genes and Genomes (KEGG). Network pharmacology analysis was performed using Gene Mania and Cytoscape software. Molecular docking was used to predict the main targets of the network. The results indicated that esketamine and arketamine share some biological targets, particularly NMDA receptor and phosphodiesterases 3A, 7A, and 5A but have specific molecular targets. While esketamine is predicted to interact with the GABAergic system, arketamine may interact with macrophage migration inhibitory factor (MIF). Both ketamine enantiomers activate neuroplasticity-related signaling pathways and show addiction potential. Our results identified novel, poorly explored molecular targets that may be related to the beneficial effects of esketamine and arketamine against depression and suicide.

Identification of kukoamine a as an anti-osteoporosis drug target using network pharmacology and experiment verification

BACKGROUND

Osteoporosis (OP) is a major and growing public health problem characterized by decreased bone mineral density and destroyed bone microarchitecture. Previous studies found that Lycium Chinense Mill (LC) has a potent role in inhibiting bone loss. Kukoamine A (KuA), a bioactive compound extract from LC was responsible for the anti-osteoporosis effect. This study aimed to investigate the anti-osteoporosis effect of KuA isolated from LC in treating OP and its potential molecular mechanism.

METHOD

In this study, network pharmacology and molecular docking were investigated firstly to find the active ingredients of LC such as KuA, and the target genes of OP by the TCMSP platform. The LC-OP-potential Target gene network was constructed by the STRING database and network maps were built by Cytoscape software. And then, the anti-osteoporotic effect of KuA in OVX-induced osteoporosis mice and MC3T3-E1 cell lines were investigated and the potential molecular mechanism including inflammation level, cell apoptosis, and oxidative stress was analyzed by dual-energy X-ray absorptiometry (DXA), micro-CT, ELISA, RT-PCR, and Western Blotting.

RESULT

A total of 22 active compounds were screened, and we found KuA was identified as the highest active ingredient. Glycogen Phosphorylase (PYGM) was the target gene associated with a maximum number of active ingredients of LC and regulated KuA. In vivo, KuA treatment significantly increased the bone mineral density and improve bone microarchitecture for example increased BV/TV, Tb.N and Tb.Th but reduced Tb.Sp in tibia and lumber 4. Furthermore, KuA increased mRNA expression of osteoblastic differentiation-related genes in OVX mice and protects against OVX-induced cell apoptosis, oxidative stress level and inflammation level. In vitro, KuA significantly improves osteogenic differentiation and mineralization in cells experiment. In addition, KuA also attenuated inflammation levels, cell apoptosis, and oxidative stress level.

CONCLUSION

The results suggest that KuA could protect against the development of OP in osteoblast cells and ovariectomized OP model mice and these found to provide a better understanding of the pharmacological activities of KuA again bone loss.

SGII: Systematic Identification of Essential lncRNAs in Mouse and Human Genome With lncRNA-Protein-Protein Heterogeneous Interaction Network

Long noncoding RNAs (lncRNAs) play important roles in a variety of biological processes. Knocking out or knocking down some lncRNA genes can lead to death or infertility. These lncRNAs are called essential lncRNAs. Identifying the essential lncRNA is of importance for complex disease diagnosis and treatments. However, experimental methods for identifying essential lncRNAs are always costly and time consuming. Therefore, computational methods can be considered as an alternative approach. We propose a method to identify essential lncRNAs by combining network centrality measures and lncRNA sequence information. By constructing a lncRNA-protein-protein interaction network, we measure the essentiality of lncRNAs from their role in the network and their sequence together. We name our method as the systematic gene importance index (SGII). As far as we can tell, this is the first attempt to identify essential lncRNAs by combining sequence and network information together. The results of our method indicated that essential lncRNAs have similar roles in the LPPI network as the essential coding genes in the PPI network. Another encouraging observation is that the network information can significantly boost the predictive performance of sequence-based method. All source code and dataset of SGII have been deposited in a GitHub repository (https://github.com/ninglolo/SGII).

Exploration in the Therapeutic and Multi-Target Mechanism of Ketamine on Cerebral Ischemia Based on Network Pharmacology and Molecular Docking

Background

Ketamine is famous for its dissociative anesthetic properties. It is also analgesic, anti-inflammatory and anti-depressant, and even has a cerebral protective effect. We searched the evidence of the correlation between ketamine target and clinical efficacy and utilized network pharmacology to gather information about the multi-target mechanism of ketamine against cerebral ischemia (CI). We found that ketamine’s clinical significance may be more extensive than previously thought.

Methods

The drug target of ketamine and CI-related genes were predicted by SwissTargetPrediction, DrugBank, PubChem, GeneCards and DisGeNET databases. The intersection of ketamine’s drug-targets and CI-related genes was analyzed by using GO and KEGG. We predicted the molecular docking between the potential target and ketamine.

Results

The results indicated that the effect of ketamine on CI was primarily associated with the target of α-synuclein (SNCA), muscarinic acetylcholine receptor M1 (CHRM1) and nitric oxide synthase 1 (NOS1). It principally regulates the signal pathways of circadian transmission, calcium signaling pathway, dopaminergic synapse, cholinergic synapse and glutamatergic synapse. Molecular docking analysis exhibited that hydrogen bond and Pi-Pi interaction were the predominant modes of interaction.

Conclusion

There are protein targets affected by ketamine in the treatment of CI. Three pivotal targets involving 298 proteins, SNCA, CHRM1 and NOS1, have emerged as multi-target mechanisms for ketamine in CI therapy. Similarly, this study also provides a new idea for introducing network pharmacology into the evaluation of multi-targeted drugs for CI and cerebral protection.

A Network Pharmacology-Based Study on Vital Pharmacological Pathways and Targets of Eucommiae Cortex Acting on Osteoporosis

Background

Eucommiae Cortex is a Chinese herbal medicine with bone protective effects and treats osteoporosis. This study aimed to explore the pharmacological mechanisms of this complex mixture.

Methods

The active compounds and disease targets involved in the study were obtained from publicly available websites and databases. Core target genes were identified by protein-protein interaction (PPI) network and topology analysis and mapped to critical components by a “component-target” regulatory network. Kyoto Encyclopedia of Genes and Genomes (KEGG) Pathway analysis and Gene Ontology (GO)analysis were performed to analyze the biological processes of target genes. Moreover, we carried out molecular docking, cell experiments, and quantitative real-time PCR to propel the research forward.

Results

Eucommiae Cortex contained 28 active ingredients and 85 potential targets for antiosteoporosis. PPI networks and topology analysis screened 17 core target genes. The therapeutic mechanism involves a series of biological reactions, including host-virus response, chemical stress, oxidative stress, and cell cycle control. The KEGG enrichment illustrated that the MAPK signaling pathway might play a significant role. The final experiment detected ten genes (EGF, AKT1, JUN, MAPK8, MAPK1, CASP3, FOS, VEGFA, EGFR, and MYC) and three compounds (quercetin, kaempferol, and beta- carotene) in the MAPK pathway. Firstly, the CCK-8 and ALP activity test results showed that three compounds could enhance the proliferation and differentiation of osteoblast-like MC3T3-E1 cells. Secondly, molecular docking confirmed the favorable binding potential. Subsequently, we observed that adding 1∗10⁻⁶ mol/L quercetin, 1∗10⁻⁵  mol/L kaempferol, and 1∗10⁻⁵  mol/L beta-carotene activated the ERK/JNK cascades and the heterodimer complex AP-1(Fos/Jun) in the MAPK pathway.

Conclusion

MAPK pathway might provide an essential mechanism for the antiosteoporosis effect of Eucommiae Cortex. Eucommiae Cortex and its active ingredients have the potential to treat osteoporosis.

A Novel Collaborative Filtering Model-Based Method for Identifying Essential Proteins

Considering that traditional biological experiments are expensive and time consuming, it is important to develop effective computational models to infer potential essential proteins. In this manuscript, a novel collaborative filtering model-based method called CFMM was proposed, in which, an updated protein–domain interaction (PDI) network was constructed first by applying collaborative filtering algorithm on the original PDI network, and then, through integrating topological features of PDI networks with biological features of proteins, a calculative method was designed to infer potential essential proteins based on an improved PageRank algorithm. The novelties of CFMM lie in construction of an updated PDI network, application of the commodity-customer-based collaborative filtering algorithm, and introduction of the calculation method based on an improved PageRank algorithm, which ensured that CFMM can be applied to predict essential proteins without relying entirely on known protein–domain associations. Simulation results showed that CFMM can achieve reliable prediction accuracies of 92.16, 83.14, 71.37, 63.87, 55.84, and 52.43% in the top 1, 5, 10, 15, 20, and 25% predicted candidate key proteins based on the DIP database, which are remarkably higher than 14 competitive state-of-the-art predictive models as a whole, and in addition, CFMM can achieve satisfactory predictive performances based on different databases with various evaluation measurements, which further indicated that CFMM may be a useful tool for the identification of essential proteins in the future.

DELEAT: gene essentiality prediction and deletion design for bacterial genome reduction

Background

The study of gene essentiality is fundamental to understand the basic principles of life, as well as for applications in many fields. In recent decades, dozens of sets of essential genes have been determined using different experimental and bioinformatics approaches, and this information has been useful for genome reduction of model organisms. Multiple in silico strategies have been developed to predict gene essentiality, but no optimal algorithm or set of gene features has been found yet, especially for non-model organisms with incomplete functional annotation.

Results

We have developed DELEAT v0.1 (DELetion design by Essentiality Analysis Tool), an easy-to-use bioinformatic tool which integrates an in silico gene essentiality classifier in a pipeline allowing automatic design of large-scale deletions in any bacterial genome. The essentiality classifier consists of a novel logistic regression model based on only six gene features which are not dependent on experimental data or functional annotation. As a proof of concept, we have applied this pipeline to the determination of dispensable regions in the genome of Bartonella quintana str. Toulouse. In this already reduced genome, 35 possible deletions have been delimited, spanning 29% of the genome.

Conclusions

Built on in silico gene essentiality predictions, we have developed an analysis pipeline which assists researchers throughout multiple stages of bacterial genome reduction projects, and created a novel classifier which is simple, fast, and universally applicable to any bacterial organism with a GenBank annotation file.

Supplementary Information

The online version contains supplementary material available at 10.1186/s12859-021-04348-5.

Pharmacological Mechanisms Underlying the Therapeutic Effects of Danhong Injection on Cerebral Ischemia

Background

Although Danhong injection (DHI) has been proved to be curative, the mechanism of its action against ischemia stroke (IS) is not clear. Here, we explored the therapeutic basis of DHI by network pharmacology.

Methods

Putative targets and activity scores for each compound in DHI were obtained from the Traditional Chinese Medicine System Pharmacology Database, Encyclopedia of Traditional Chinese Medicine, and Quantitative Structure Activity Relationships. Next, target proteins of IS were identified on GeneCards and CTD. Overlapping targets of DHI associated with IS were acquired via Venn diagram. GO and KEGG pathway analyses were done using WebGestalt. Cytoscape software was used for PPI network construction and hub nodes screening. Several validation studies were carried out by using AutoDock-Vina, label-free mass spectrometry, and transcriptome RNA-sequencing.

Results

The 37 active compounds and 66 targets were identified. Of these, 26 compounds and 41 targets belonged to diterpenoid quinones (DQs), which is the predominant category based on chemical structure. The results of enrichments analysis show that 8 DQs target proteins associated with IS were involved in several biological processes and signaling pathway such as apoptotic, cell cycle, cellular response to xenobiotic stimulus process, and the PI3K-Akt signaling. Moreover, 3 nodes in core module involved in PI3K-Akt signaling and 1 hub node were identified by PPI network analysis. Finally, the results of molecular docking and label-free mass spectrometry display good effect on hub node regulation in DHI treatment.

Conclusions

DQs is the predominant category of DHI and play an important role in antiapoptotic activity mediated by modulating PI3K-Akt signaling. Our findings offer insight into future research and clinical applications in IS therapy.

Machine learning approach to gene essentiality prediction: a review

 

Essential genes are critical for the growth and survival of any organism. The machine learning approach complements the experimental methods to minimize the resources required for essentiality assays. Previous studies revealed the need to discover relevant features that significantly classify essential genes, improve on the generalizability of prediction models across organisms, and construct a robust gold standard as the class label for the train data to enhance prediction. Findings also show that a significant limitation of the machine learning approach is predicting conditionally essential genes. The essentiality status of a gene can change due to a specific condition of the organism. This review examines various methods applied to essential gene prediction task, their strengths, limitations and the factors responsible for effective computational prediction of essential genes. We discussed categories of features and how they contribute to the classification performance of essentiality prediction models. Five categories of features, namely, gene sequence, protein sequence, network topology, homology and gene ontology-based features, were generated for Caenorhabditis elegans to perform a comparative analysis of their essentiality prediction capacity. Gene ontology-based feature category outperformed other categories of features majorly due to its high correlation with the genes' biological functions. However, the topology feature category provided the highest discriminatory power making it more suitable for essentiality prediction. The major limiting factor of machine learning to predict essential genes conditionality is the unavailability of labeled data for interest conditions that can train a classifier. Therefore, cooperative machine learning could further exploit models that can perform well in conditional essentiality predictions.

SHORT ABSTRACT

Identification of essential genes is imperative because it provides an understanding of the core structure and function, accelerating drug targets' discovery, among other functions. Recent studies have applied machine learning to complement the experimental identification of essential genes. However, several factors are limiting the performance of machine learning approaches. This review aims to present the standard procedure and resources available for predicting essential genes in organisms, and also highlight the factors responsible for the current limitation in using machine learning for conditional gene essentiality prediction. The choice of features and ML technique was identified as an important factor to predict essential genes effectively.

A Novel Multi-Ensemble Method for Identifying Essential Proteins

Essential proteins possess critical functions for cell survival. Identifying essential proteins improves our understanding of how a cell works and also plays a vital role in the research fields of disease treatment and drug development. Recently, some machine-learning methods and ensemble learning methods have been proposed to identify essential proteins by introducing effective protein features. However, the ensemble learning method only used to focus on the choice of base classifiers. In this article, we propose a novel ensemble learning framework called multi-ensemble to integrate different base classifiers. The multi-ensemble method adopts the idea of multi-view learning and selects multiple base classifiers and trains those classifiers by continually adding the samples that are predicted correctly by the other base classifiers. We applied multi-ensemble to Yeast data and Escherichia coli data. The results show that our approach achieved better performance than both individual classifiers and the other ensemble learning methods.

Based on Network Pharmacology to Explore the Molecular Targets and Mechanisms of Gegen Qinlian Decoction for the Treatment of Ulcerative Colitis

Background

Gegen Qinlian (GGQL) decoction is a common Chinese herbal compound for the treatment of ulcerative colitis (UC). In this study, we aimed to identify its molecular target and the mechanism involved in UC treatment by network pharmacology and molecular docking. Material and Methods. The active ingredients of Puerariae, Scutellariae, Coptis, and Glycyrrhiza were screened using the TCMSP platform with drug‐like properties (DL) ≥ 0.18 and oral availability (OB) ≥ 30%. To find the intersection genes and construct the TCM compound-disease regulatory network, the molecular targets were determined in the UniProt database and then compared with the UC disease differential genes with P value < 0.005 and ∣log2 (fold change) | >1 obtained in the GEO database. The intersection genes were subjected to protein-protein interaction (PPI) construction and Gene Ontology (GO) and Kyoto Encyclopedia of Genes and Genomes (KEGG) enrichment analysis. After screening the key active ingredients and target genes, the AutoDock software was used for molecular docking, and the best binding target was selected for molecular docking to verify the binding activity.

Results

A total of 146 active compounds were screened, and quercetin, kaempferol, wogonin, and stigmasterol were identified as the active ingredients with the highest associated targets, and NOS2, PPARG, and MMP1 were the targets associated with the maximum number of active ingredients. Through topological analysis, 32 strongly associated proteins were found, of which EGFR, PPARG, ESR1, HSP90AA1, MYC, HSPA5, AR, AKT1, and RELA were predicted targets of the traditional Chinese medicine, and PPARG was also an intersection gene. It was speculated that these targets were the key to the use of GGQL in UC treatment. GO enrichment results showed significant enrichment of biological processes, such as oxygen levels, leukocyte migration, collagen metabolic processes, and nutritional coping. KEGG enrichment showed that genes were particularly enriched in the IL-17 signaling pathway, AGE-RAGE signaling pathway, toll-like receptor signaling pathway, tumor necrosis factor signaling pathway, transcriptional deregulation in cancer, and other pathways. Molecular docking results showed that key components in GGQL had good potential to bind to the target genes MMP3, IL1B, NOS2, HMOX1, PPARG, and PLAU.

Conclusion

GGQL may play a role in the treatment of ulcerative colitis by anti-inflammation, antioxidation, and inhibition of cancer gene transcription.

Network Embedding the Protein-Protein Interaction Network for Human Essential Genes Identification

Essential genes are a group of genes that are indispensable for cell survival and cell fertility. Studying human essential genes helps scientists reveal the underlying biological mechanisms of a human cell but also guides disease treatment. Recently, the publication of human essential gene data makes it possible for researchers to train a machine-learning classifier by using some features of the known human essential genes and to use the classifier to predict new human essential genes. Previous studies have found that the essentiality of genes closely relates to their properties in the protein–protein interaction (PPI) network. In this work, we propose a novel supervised method to predict human essential genes by network embedding the PPI network. Our approach implements a bias random walk on the network to get the node network context. Then, the node pairs are input into an artificial neural network to learn their representation vectors that maximally preserves network structure and the properties of the nodes in the network. Finally, the features are put into an SVM classifier to predict human essential genes. The prediction results on two human PPI networks show that our method achieves better performance than those that refer to either genes’ sequence information or genes’ centrality properties in the network as input features. Moreover, it also outperforms the methods that represent the PPI network by other previous approaches.

Sequence-Derived Markers of Drug Targets and Potentially Druggable Human Proteins

Recent research shows that majority of the druggable human proteome is yet to be annotated and explored. Accurate identification of these unexplored druggable proteins would facilitate development, screening, repurposing, and repositioning of drugs, as well as prediction of new drug–protein interactions. We contrast the current drug targets against the datasets of non-druggable and possibly druggable proteins to formulate markers that could be used to identify druggable proteins. We focus on the markers that can be extracted from protein sequences or names/identifiers to ensure that they can be applied across the entire human proteome. These markers quantify key features covered in the past works (topological features of PPIs, cellular functions, and subcellular locations) and several novel factors (intrinsic disorder, residue-level conservation, alternative splicing isoforms, domains, and sequence-derived solvent accessibility). We find that the possibly druggable proteins have significantly higher abundance of alternative splicing isoforms, relatively large number of domains, higher degree of centrality in the protein-protein interaction networks, and lower numbers of conserved and surface residues, when compared with the non-druggable proteins. We show that the current drug targets and possibly druggable proteins share involvement in the catalytic and signaling functions. However, unlike the drug targets, the possibly druggable proteins participate in the metabolic and biosynthesis processes, are enriched in the intrinsic disorder, interact with proteins and nucleic acids, and are localized across the cell. To sum up, we formulate several markers that can help with finding novel druggable human proteins and provide interesting insights into the cellular functions and subcellular locations of the current drug targets and potentially druggable proteins.

Identifying Bacterial Essential Genes Based on a Feature-Integrated Method

Essential genes are those genes of an organism that are considered to be crucial for its survival. Identification of essential genes is therefore of great significance to advance our understanding of the principles of cellular life. We have developed a novel computational method, which can effectively predict bacterial essential genes by extracting and integrating homologous features, protein domain feature, gene intrinsic features, and network topological features. By performing the principal component regression (PCR) analysis for Escherichia coli MG1655, we established a classification model with the average area under curve (AUC) value of 0.992 in ten times 5-fold cross-validation tests. Furthermore, when employing this new model to a distantly related organism-Streptococcus pneumoniae TIGR4, we still got a reliable AUC value of 0.788. These results indicate that our feature-integrated approach could have practical applications in accurately investigating essential genes from broad bacterial species, and also provide helpful guidelines for the minimal cell.

Network-based methods for predicting essential genes or proteins: a survey

Genes that are thought to be critical for the survival of organisms or cells are called essential genes. The prediction of essential genes and their products (essential proteins) is of great value in exploring the mechanism of complex diseases, the study of the minimal required genome for living cells and the development of new drug targets. As laboratory methods are often complicated, costly and time-consuming, a great many of computational methods have been proposed to identify essential genes/proteins from the perspective of the network level with the in-depth understanding of network biology and the rapid development of biotechnologies. Through analyzing the topological characteristics of essential genes/proteins in protein–protein interaction networks (PINs), integrating biological information and considering the dynamic features of PINs, network-based methods have been proved to be effective in the identification of essential genes/proteins. In this paper, we survey the advanced methods for network-based prediction of essential genes/proteins and present the challenges and directions for future research.

A Novel Method for Identifying Essential Genes by Fusing Dynamic Protein⁻Protein Interactive Networks

Essential genes play an indispensable role in supporting the life of an organism. Identification of essential genes helps us to understand the underlying mechanism of cell life. The essential genes of bacteria are potential drug targets of some diseases genes. Recently, several computational methods have been proposed to detect essential genes based on the static protein⁻protein interactive (PPI) networks. However, these methods have ignored the fact that essential genes play essential roles under certain conditions. In this work, a novel method was proposed for the identification of essential proteins by fusing the dynamic PPI networks of different time points (called by FDP). Firstly, the active PPI networks of each time point were constructed and then they were fused into a final network according to the networks' similarities. Finally, a novel centrality method was designed to assign each gene in the final network a ranking score, whilst considering its orthologous property and its global and local topological properties in the network. This model was applied on two different yeast data sets. The results showed that the FDP achieved a better performance in essential gene prediction as compared to other existing methods that are based on the static PPI network or that are based on dynamic networks.

A model to predict the function of hypothetical proteins through a nine-point classification scoring schema

BACKGROUND

Hypothetical proteins [HP] are those that are predicted to be expressed in an organism, but no evidence of their existence is known. In the recent past, annotation and curation efforts have helped overcome the challenge in understanding their diverse functions. Techniques to decipher sequence-structure-function relationship, especially in terms of functional modelling of the HPs have been developed by researchers, but using the features as classifiers for HPs has not been attempted. With the rise in number of annotation strategies, next-generation sequencing methods have provided further understanding the functions of HPs.

RESULTS

In our previous work, we developed a six-point classification scoring schema with annotation pertaining to protein family scores, orthology, protein interaction/association studies, bidirectional best BLAST hits, sorting signals, known databases and visualizers which were used to validate protein interactions. In this study, we introduced three more classifiers to our annotation system, viz. pseudogenes linked to HPs, homology modelling and non-coding RNAs associated to HPs. We discuss the challenges and performance of these classifiers using machine learning heuristics with an improved accuracy from Perceptron (81.08 to 97.67), Naive Bayes (54.05 to 96.67), Decision tree J48 (67.57 to 97.00), and SMO_npolyk (59.46 to 96.67).

CONCLUSION

With the introduction of three new classification features, the performance of the nine-point classification scoring schema has an improved accuracy to functionally annotate the HPs.

Feature Selection via Swarm Intelligence for Determining Protein Essentiality

Protein essentiality is fundamental to comprehend the function and evolution of genes. The prediction of protein essentiality is pivotal in identifying disease genes and potential drug targets. Since the experimental methods need many investments in time and funds, it is of great value to predict protein essentiality with high accuracy using computational methods. In this study, we present a novel feature selection named Elite Search mechanism-based Flower Pollination Algorithm (ESFPA) to determine protein essentiality. Unlike other protein essentiality prediction methods, ESFPA uses an improved swarm intelligence⁻based algorithm for feature selection and selects optimal features for protein essentiality prediction. The first step is to collect numerous features with the highly predictive characteristics of essentiality. The second step is to develop a feature selection strategy based on a swarm intelligence algorithm to obtain the optimal feature subset. Furthermore, an elite search mechanism is adopted to further improve the quality of feature subset. Subsequently a hybrid classifier is applied to evaluate the essentiality for each protein. Finally, the experimental results show that our method is competitive to some well-known feature selection methods. The proposed method aims to provide a new perspective for protein essentiality determination.

Predicting essential proteins by integrating orthology, gene expressions, and PPI networks

Identifying essential proteins is very important for understanding the minimal requirements of cellular life and finding human disease genes as well as potential drug targets. Experimental methods for identifying essential proteins are often costly, time-consuming, and laborious. Many computational methods for such task have been proposed based on the topological properties of protein-protein interaction networks (PINs). However, most of these methods have limited prediction accuracy due to the noisy and incomplete natures of PINs and the fact that protein essentiality may relate to multiple biological factors. In this work, we proposed a new centrality measure, OGN, by integrating orthologous information, gene expressions, and PINs together. OGN determines a protein’s essentiality by capturing its co-clustering and co-expression properties, as well as its conservation in the evolution process. The performance of OGN was tested on the species of Saccharomyces cerevisiae. Compared with several published centrality measures, OGN achieves higher prediction accuracy in both working alone and ensemble.

A Comprehensive Overview of Online Resources to Identify and Predict Bacterial Essential Genes

Genes critical for the survival or reproduction of an organism in certain circumstances are classified as essential genes. Essential genes play a significant role in deciphering the survival mechanism of life. They may be greatly applied to pharmaceutics and synthetic biology. The continuous progress of experimental method for essential gene identification has accelerated the accumulation of gene essentiality data which facilitates the study of essential genes in silico. In this article, we present some available online resources related to gene essentiality, including bioinformatic software tools for transposon sequencing (Tn-seq) analysis, essential gene databases and online services to predict bacterial essential genes. We review several computational approaches that have been used to predict essential genes, and summarize the features used for gene essentiality prediction. In addition, we evaluate the available online bacterial essential gene prediction servers based on the experimentally validated essential gene sets of 30 bacteria from DEG. This article is intended to be a quick reference guide for the microbiologists interested in the essential genes.

United Complex Centrality for Identification of Essential Proteins from PPI Networks

Essential proteins are indispensable for the survival or reproduction of an organism. Identification of essential proteins is not only necessary for the understanding of the minimal requirements for cellular life, but also important for the disease study and drug design. With the development of high-throughput techniques, a large number of protein-protein interaction data are available, which promotes the studies of essential proteins from the network level. Up to now, though a series of computational methods have been proposed, the prediction precision still needs to be improved. In this paper, we propose a new method, United complex Centrality (UC), to identify essential proteins by integrating the protein complexes with the topological features of protein-protein interaction (PPI) networks. By analyzing the relationship between the essential proteins and the known protein complexes of S. cerevisiae and human, we find that the proteins in complexes are more likely to be essential compared with the proteins not included in any complexes and the proteins appeared in multiple complexes are more inclined to be essential compared to those only appeared in a single complex. Considering that some protein complexes generated by computational methods are inaccurate, we also provide a modified version of UC with parameter alpha, named UC-P. The experimental results show that protein complex information can help identify the essential proteins more accurate both for the PPI network of S. cerevisiae and that of human. The proposed method UC performs obviously better than the eight previously proposed methods (DC, IC, EC, SC, BC, CC, NC, and LAC) for identifying essential proteins.

An ensemble framework for identifying essential proteins

Background

Many centrality measures have been proposed to mine and characterize the correlations between network topological properties and protein essentiality. However, most of them show limited prediction accuracy, and the number of common predicted essential proteins by different methods is very small.

Results

In this paper, an ensemble framework is proposed which integrates gene expression data and protein-protein interaction networks (PINs). It aims to improve the prediction accuracy of basic centrality measures. The idea behind this ensemble framework is that different protein-protein interactions (PPIs) may show different contributions to protein essentiality. Five standard centrality measures (degree centrality, betweenness centrality, closeness centrality, eigenvector centrality, and subgraph centrality) are integrated into the ensemble framework respectively. We evaluated the performance of the proposed ensemble framework using yeast PINs and gene expression data. The results show that it can considerably improve the prediction accuracy of the five centrality measures individually. It can also remarkably increase the number of common predicted essential proteins among those predicted by each centrality measure individually and enable each centrality measure to find more low-degree essential proteins.

Conclusions

This paper demonstrates that it is valuable to differentiate the contributions of different PPIs for identifying essential proteins based on network topological characteristics. The proposed ensemble framework is a successful paradigm to this end.

Electronic supplementary material

The online version of this article (doi:10.1186/s12859-016-1166-7) contains supplementary material, which is available to authorized users.

CentiServer: A Comprehensive Resource, Web-Based Application and R Package for Centrality Analysis

Various disciplines are trying to solve one of the most noteworthy queries and broadly used concepts in biology, essentiality. Centrality is a primary index and a promising method for identifying essential nodes, particularly in biological networks. The newly created CentiServer is a comprehensive online resource that provides over 110 definitions of different centrality indices, their computational methods, and algorithms in the form of an encyclopedia. In addition, CentiServer allows users to calculate 55 centralities with the help of an interactive web-based application tool and provides a numerical result as a comma separated value (csv) file format or a mapped graphical format as a graph modeling language (GML) file. The standalone version of this application has been developed in the form of an R package. The web-based application (CentiServer) and R package (centiserve) are freely available at http://www.centiserver.org/

A Topology Potential-Based Method for Identifying Essential Proteins from PPI Networks

Essential proteins are indispensable for cellular life. It is of great significance to identify essential proteins that can help us understand the minimal requirements for cellular life and is also very important for drug design. However, identification of essential proteins based on experimental approaches are typically time-consuming and expensive. With the development of high-throughput technology in the post-genomic era, more and more protein-protein interaction data can be obtained, which make it possible to study essential proteins from the network level. There have been a series of computational approaches proposed for predicting essential proteins based on network topologies. Most of these topology based essential protein discovery methods were to use network centralities. In this paper, we investigate the essential proteins' topological characters from a completely new perspective. To our knowledge it is the first time that topology potential is used to identify essential proteins from a protein-protein interaction (PPI) network. The basic idea is that each protein in the network can be viewed as a material particle which creates a potential field around itself and the interaction of all proteins forms a topological field over the network. By defining and computing the value of each protein's topology potential, we can obtain a more precise ranking which reflects the importance of proteins from the PPI network. The experimental results show that topology potential-based methods TP and TP-NC outperform traditional topology measures: degree centrality (DC), betweenness centrality (BC), closeness centrality (CC), subgraph centrality (SC), eigenvector centrality (EC), information centrality (IC), and network centrality (NC) for predicting essential proteins. In addition, these centrality measures are improved on their performance for identifying essential proteins in biological network when controlled by topology potential.

UDoNC: An Algorithm for Identifying Essential Proteins Based on Protein Domains and Protein-Protein Interaction Networks

Prediction of essential proteins which are crucial to an organism's survival is important for disease analysis and drug design, as well as the understanding of cellular life. The majority of prediction methods infer the possibility of proteins to be essential by using the network topology. However, these methods are limited to the completeness of available protein-protein interaction (PPI) data and depend on the network accuracy. To overcome these limitations, some computational methods have been proposed. However, seldom of them solve this problem by taking consideration of protein domains. In this work, we first analyze the correlation between the essentiality of proteins and their domain features based on data of 13 species. We find that the proteins containing more protein domain types which rarely occur in other proteins tend to be essential. Accordingly, we propose a new prediction method, named UDoNC, by combining the domain features of proteins with their topological properties in PPI network. In UDoNC, the essentiality of proteins is decided by the number and the frequency of their protein domain types, as well as the essentiality of their adjacent edges measured by edge clustering coefficient. The experimental results on S. cerevisiae data show that UDoNC outperforms other existing methods in terms of area under the curve (AUC). Additionally, UDoNC can also perform well in predicting essential proteins on data of E. coli.

Network output controllability-based method for drug target identification

Biomolecules do not perform their functions alone, but interactively with one another to form so called biomolecular networks. It is well known that a complex disease stems from the malfunctions of corresponding biomolecular networks. Therefore, one of important tasks is to identify drug targets from biomolecular networks. In this study, the drug target identification is formulated as a problem of finding steering nodes in biomolecular networks while the concept of network output controllability is applied to the problem of drug target identification. By applying control signals to these steering nodes, the biomolecular networks are expected to be transited from one state to another. A graph-theoretic algorithm has been proposed to find a minimum set of steering nodes in biomolecular networks which can be a potential set of drug targets. Application results of the method to real biomolecular networks show that identified potential drug targets are in agreement with existing research results. This indicates that the method can generate testable predictions and provide insights into experimental design of drug discovery.

Three computational tools for predicting bacterial essential genes

Essential genes are those genes indispensable for the survival of any living cell. Bacterial essential genes constitute the cornerstones of synthetic biology and are often attractive targets in the development of antibiotics and vaccines. Because identification of essential genes with wet-lab ways often means expensive economic costs and tremendous labor, scientists changed to seek for alternative way of computational prediction. Aiming to help to solve this issue, our research group (CEFG: group of Computational, Comparative, Evolutionary and Functional Genomics, http://cefg.uestc.edu.cn) has constructed three online services to predict essential genes in bacterial genomes. These freely available tools are applicable for single gene sequences without annotated functions, single genes with definite names, and complete genomes of bacterial strains. To ensure reliable predictions, the investigated species should belong to the same family (for EGP) or phylum (for CEG_Match and Geptop) with one of the reference species, respectively. As the pilot software for the issue, predicting accuracies of them have been assessed and compared with existing algorithms, and note that all of other published algorithms have not any formed online services. We hope these services at CEFG will help scientists and researchers in the field of essential genes.

CytoNCA: a cytoscape plugin for centrality analysis and evaluation of protein interaction networks

BACKGROUND AND SCOPE

Nowadays, centrality analysis has become a principal method for identifying essential proteins in biological networks. Here we present CytoNCA, a Cytoscape plugin integrating calculation, evaluation and visualization analysis for multiple centrality measures.

IMPLEMENTATION AND PERFORMANCE

(i) CytoNCA supports eight different centrality measures and each can be applied to both weighted and unweighted biological networks. (ii) It allows users to upload biological information of both nodes and edges in the network, to integrate biological data with topological data to detect specific nodes. (iii) CytoNCA offers multiple potent visualization analysis modules, which generate various forms of output such as graph, table, and chart, and analyze associations among all measures. (iv) It can be utilized to quantitatively assess the calculation results, and evaluate the accuracy by statistical measures. (v) Besides current eight centrality measures, the biological characters from other sources could also be analyzed and assessed by CytoNCA. This makes CytoNCA an excellent tool for calculating centrality, evaluating and visualizing biological networks.

AVAILABILITY

http://apps.cytoscape.org/apps/cytonca.

Prediction of disease-related genes based on weighted tissue-specific networks by using DNA methylation

BACKGROUND

Predicting disease-related genes is one of the most important tasks in bioinformatics and systems biology. With the advances in high-throughput techniques, a large number of protein-protein interactions are available, which make it possible to identify disease-related genes at the network level. However, network-based identification of disease-related genes is still a challenge as the considerable false-positives are still existed in the current available protein interaction networks (PIN).

RESULTS

Considering the fact that the majority of genetic disorders tend to manifest only in a single or a few tissues, we constructed tissue-specific networks (TSN) by integrating PIN and tissue-specific data. We further weighed the constructed tissue-specific network (WTSN) by using DNA methylation as it plays an irreplaceable role in the development of complex diseases. A PageRank-based method was developed to identify disease-related genes from the constructed networks. To validate the effectiveness of the proposed method, we constructed PIN, weighted PIN (WPIN), TSN, WTSN for colon cancer and leukemia, respectively. The experimental results on colon cancer and leukemia show that the combination of tissue-specific data and DNA methylation can help to identify disease-related genes more accurately. Moreover, the PageRank-based method was effective to predict disease-related genes on the case studies of colon cancer and leukemia.

CONCLUSIONS

Tissue-specific data and DNA methylation are two important factors to the study of human diseases. The same method implemented on the WTSN can achieve better results compared to those being implemented on original PIN, WPIN, or TSN. The PageRank-based method outperforms degree centrality-based method for identifying disease-related genes from WTSN.

Prediction of disease genes using tissue-specified gene-gene network

BACKGROUND

Tissue specificity is an important aspect of many genetic diseases in the context of genetic disorders as the disorder affects only few tissues. Therefore tissue specificity is important in identifying disease-gene associations. Hence this paper seeks to discuss the impact of using tissue specificity in predicting new disease-gene associations and how to use tissue specificity along with phenotype information for a particular disease.

METHODS

In order to find out the impact of using tissue specificity for predicting new disease-gene associations, this study proposes a novel method called tissue-specified genes to construct tissues-specific gene-gene networks for different tissue samples. Subsequently, these networks are used with phenotype details to predict disease genes by using Katz method. The proposed method was compared with three other tissue-specific network construction methods in order to check its effectiveness. Furthermore, to check the possibility of using tissue-specific gene-gene network instead of generic protein-protein network at all time, the results are compared with three other methods.

RESULTS

In terms of leave-one-out cross validation, calculation of the mean enrichment and ROC curves indicate that the proposed approach outperforms existing network construction methods. Furthermore tissues-specific gene-gene networks make a more positive impact on predicting disease-gene associations than generic protein-protein interaction networks.

CONCLUSIONS

In conclusion by integrating tissue-specific data it enabled prediction of known and unknown disease-gene associations for a particular disease more effectively. Hence it is better to use tissue-specific gene-gene network whenever possible. In addition the proposed method is a better way of constructing tissue-specific gene-gene networks.

Prioritization of orphan disease-causing genes using topological feature and GO similarity between proteins in interaction networks

Identification of disease-causing genes among a large number of candidates is a fundamental challenge in human disease studies. However, it is still time-consuming and laborious to determine the real disease-causing genes by biological experiments. With the advances of the high-throughput techniques, a large number of protein-protein interactions have been produced. Therefore, to address this issue, several methods based on protein interaction network have been proposed. In this paper, we propose a shortest path-based algorithm, named SPranker, to prioritize disease-causing genes in protein interaction networks. Considering the fact that diseases with similar phenotypes are generally caused by functionally related genes, we further propose an improved algorithm SPGOranker by integrating the semantic similarity of GO annotations. SPGOranker not only considers the topological similarity between protein pairs in a protein interaction network but also takes their functional similarity into account. The proposed algorithms SPranker and SPGOranker were applied to 1598 known orphan disease-causing genes from 172 orphan diseases and compared with three state-of-the-art approaches, ICN, VS and RWR. The experimental results show that SPranker and SPGOranker outperform ICN, VS, and RWR for the prioritization of orphan disease-causing genes. Importantly, for the case study of severe combined immunodeficiency, SPranker and SPGOranker predict several novel causal genes.

PREDICTION OF ESSENTIAL PROTEINS BASED ON EDGE CLUSTERING COEFFICIENT AND GENE ONTOLOGY INFORMATION

Essential proteins are important for the survival and development of organisms. Lots of centrality algorithms based on network topology have been proposed to detect essential proteins and achieve good results. However, most of them only focus on the network topology, but ignore the false positive (FP) interactions in protein–protein interaction (PPI) network. In this paper, gene ontology (GO) information is proposed to measure the reliability of the edges in PPI network and we propose a novel algorithm for identifying essential proteins, named EGC algorithm. EGC algorithm integrates topology character of PPI network and GO information. To validate the performance of EGC algorithm, we use EGC and other nine methods (DC, BC, CC, SC, EC, LAC, NC, PEC and CoEWC) to identify the essential proteins in the two different yeast PPI networks: DIP and MIPS. The results show that EGC is better than the other nine methods, which means adding GO information can help in predicting essential proteins.

Protein localization analysis of essential genes in prokaryotes

Essential genes, those critical for the survival of an organism under certain conditions, play a significant role in pharmaceutics and synthetic biology. Knowledge of protein localization is invaluable for understanding their function as well as the interaction of different proteins. However, systematical examination of essential genes from the aspect of the localizations of proteins they encode has not been explored before. Here, a comprehensive protein localization analysis of essential genes in 27 prokaryotes including 24 bacteria, 2 mycoplasmas and 1 archaeon has been performed. Both statistical analysis of localization information in these genomes and GO (Gene Ontology) terms enriched in the essential genes show that proteins encoded by essential genes are enriched in internal location sites, while exist in cell envelope with a lower proportion compared with non-essential ones. Meanwhile, there are few essential proteins in the external subcellular location sites such as flagellum and fimbrium, and proteins encoded by non-essential genes tend to have diverse localizations. These results would provide further insights into the understanding of fundamental functions needed to support a cellular life and improve gene essentiality prediction by taking the protein localization and enriched GO terms into consideration.

Prediction of essential proteins based on overlapping essential modules

Many computational methods have been proposed to identify essential proteins by using the topological features of interactome networks. However, the precision of essential protein discovery still needs to be improved. Researches show that majority of hubs (essential proteins) in the yeast interactome network are essential due to their involvement in essential complex biological modules and hubs can be classified into two categories: date hubs and party hubs. In this study, combining with gene expression profiles, we propose a new method to predict essential proteins based on overlapping essential modules, named POEM. In POEM, the original protein interactome network is partitioned into many overlapping essential modules. The frequencies and weighted degrees of proteins in these modules are employed to decide which categories does a protein belong to? The comparative results show that POEM outperforms the classical centrality measures: Degree Centrality (DC), Information Centrality (IC), Eigenvector Centrality (EC), Subgraph Centrality (SC), Betweenness Centrality (BC), Closeness Centrality (CC), Edge Clustering Coefficient Centrality (NC), and two newly proposed essential proteins prediction methods: PeC and CoEWC. Experimental results indicate that the precision of predicting essential proteins can be improved by considering the modularity of proteins and integrating gene expression profiles with network topological features.

Identifying hierarchical and overlapping protein complexes based on essential protein-protein interactions and "seed-expanding" method

Many evidences have demonstrated that protein complexes are overlapping and hierarchically organized in PPI networks. Meanwhile, the large size of PPI network wants complex detection methods have low time complexity. Up to now, few methods can identify overlapping and hierarchical protein complexes in a PPI network quickly. In this paper, a novel method, called MCSE, is proposed based on λ-module and "seed-expanding." First, it chooses seeds as essential PPIs or edges with high edge clustering values. Then, it identifies protein complexes by expanding each seed to a λ-module. MCSE is suitable for large PPI networks because of its low time complexity. MCSE can identify overlapping protein complexes naturally because a protein can be visited by different seeds. MCSE uses the parameter λ_th to control the range of seed expanding and can detect a hierarchical organization of protein complexes by tuning the value of λ_th. Experimental results of S. cerevisiae show that this hierarchical organization is similar to that of known complexes in MIPS database. The experimental results also show that MCSE outperforms other previous competing algorithms, such as CPM, CMC, Core-Attachment, Dpclus, HC-PIN, MCL, and NFC, in terms of the functional enrichment and matching with known protein complexes.

Prediction of essential proteins based on gene expression programming

Background

Essential proteins are indispensable for cell survive. Identifying essential proteins is very important for improving our understanding the way of a cell working. There are various types of features related to the essentiality of proteins. Many methods have been proposed to combine some of them to predict essential proteins. However, it is still a big challenge for designing an effective method to predict them by integrating different features, and explaining how these selected features decide the essentiality of protein. Gene expression programming (GEP) is a learning algorithm and what it learns specifically is about relationships between variables in sets of data and then builds models to explain these relationships.

Results

In this work, we propose a GEP-based method to predict essential protein by combing some biological features and topological features. We carry out experiments on S. cerevisiae data. The experimental results show that the our method achieves better prediction performance than those methods using individual features. Moreover, our method outperforms some machine learning methods and performs as well as a method which is obtained by combining the outputs of eight machine learning methods.

Conclusions

The accuracy of predicting essential proteins can been improved by using GEP method to combine some topological features and biological features.