RESUMEN
Drug repositioning (DR) is a promising strategy to discover new indicators of approved drugs with artificial intelligence techniques, thus improving traditional drug discovery and development. However, most of DR computational methods fall short of taking into account the non-Euclidean nature of biomedical network data. To overcome this problem, a deep learning framework, namely DDAGDL, is proposed to predict drug-drug associations (DDAs) by using geometric deep learning (GDL) over heterogeneous information network (HIN). Incorporating complex biological information into the topological structure of HIN, DDAGDL effectively learns the smoothed representations of drugs and diseases with an attention mechanism. Experiment results demonstrate the superior performance of DDAGDL on three real-world datasets under 10-fold cross-validation when compared with state-of-the-art DR methods in terms of several evaluation metrics. Our case studies and molecular docking experiments indicate that DDAGDL is a promising DR tool that gains new insights into exploiting the geometric prior knowledge for improved efficacy.
Asunto(s)
Aprendizaje Profundo , Reposicionamiento de Medicamentos , Reposicionamiento de Medicamentos/métodos , Inteligencia Artificial , Simulación del Acoplamiento Molecular , Servicios de Información , Algoritmos , Biología Computacional/métodosRESUMEN
MOTIVATION: The task of predicting drug-target interactions (DTIs) plays a significant role in facilitating the development of novel drug discovery. Compared with laboratory-based approaches, computational methods proposed for DTI prediction are preferred due to their high-efficiency and low-cost advantages. Recently, much attention has been attracted to apply different graph neural network (GNN) models to discover underlying DTIs from heterogeneous biological information network (HBIN). Although GNN-based prediction methods achieve better performance, they are prone to encounter the over-smoothing simulation when learning the latent representations of drugs and targets with their rich neighborhood information in HBIN, and thereby reduce the discriminative ability in DTI prediction. RESULTS: In this work, an improved graph representation learning method, namely iGRLDTI, is proposed to address the above issue by better capturing more discriminative representations of drugs and targets in a latent feature space. Specifically, iGRLDTI first constructs an HBIN by integrating the biological knowledge of drugs and targets with their interactions. After that, it adopts a node-dependent local smoothing strategy to adaptively decide the propagation depth of each biomolecule in HBIN, thus significantly alleviating over-smoothing by enhancing the discriminative ability of feature representations of drugs and targets. Finally, a Gradient Boosting Decision Tree classifier is used by iGRLDTI to predict novel DTIs. Experimental results demonstrate that iGRLDTI yields better performance that several state-of-the-art computational methods on the benchmark dataset. Besides, our case study indicates that iGRLDTI can successfully identify novel DTIs with more distinguishable features of drugs and targets. AVAILABILITY AND IMPLEMENTATION: Python codes and dataset are available at https://github.com/stevejobws/iGRLDTI/.
Asunto(s)
Descubrimiento de Drogas , Redes Neurales de la Computación , Simulación por Computador , Descubrimiento de Drogas/métodos , Interacciones FarmacológicasRESUMEN
Interactions between transcription factor and target gene form the main part of gene regulation network in human, which are still complicating factors in biological research. Specifically, for nearly half of those interactions recorded in established database, their interaction types are yet to be confirmed. Although several computational methods exist to predict gene interactions and their type, there is still no method available to predict them solely based on topology information. To this end, we proposed here a graph-based prediction model called KGE-TGI and trained in a multi-task learning manner on a knowledge graph that we specially constructed for this problem. The KGE-TGI model relies on topology information rather than being driven by gene expression data. In this paper, we formulate the task of predicting interaction types of transcript factor and target genes as a multi-label classification problem for link types on a heterogeneous graph, coupled with solving another link prediction problem that is inherently related. We constructed a ground truth dataset as benchmark and evaluated the proposed method on it. As a result of the 5-fold cross experiments, the proposed method achieved average AUC values of 0.9654 and 0.9339 in the tasks of link prediction and link type classification, respectively. In addition, the results of a series of comparison experiments also prove that the introduction of knowledge information significantly benefits to the prediction and that our methodology achieve state-of-the-art performance in this problem.
Asunto(s)
Reconocimiento de Normas Patrones Automatizadas , Factores de Transcripción , Humanos , Bases de Datos Factuales , Factores de Transcripción/genética , Redes Reguladoras de Genes , Proteoma , Algoritmos , Biología de Sistemas , Ontología de GenesRESUMEN
Discovering new indications for existing drugs is a promising development strategy at various stages of drug research and development. However, most of them complete their tasks by constructing a variety of heterogeneous networks without considering available higher-order connectivity patterns in heterogeneous biological information networks, which are believed to be useful for improving the accuracy of new drug discovering. To this end, we propose a computational-based model, called SFRLDDA, for drug-disease association prediction by using semantic graph and function similarity representation learning. Specifically, SFRLDDA first integrates a heterogeneous information network (HIN) by drug-disease, drug-protein, protein-disease associations, and their biological knowledge. Second, different representation learning strategies are applied to obtain the feature representations of drugs and diseases from different perspectives over semantic graph and function similarity graphs constructed, respectively. At last, a Random Forest classifier is incorporated by SFRLDDA to discover potential drug-disease associations (DDAs). Experimental results demonstrate that SFRLDDA yields a best performance when compared with other state-of-the-art models on three benchmark datasets. Moreover, case studies also indicate that the simultaneous consideration of semantic graph and function similarity of drugs and diseases in the HIN allows SFRLDDA to precisely predict DDAs in a more comprehensive manner.
Asunto(s)
Algoritmos , Semántica , Servicios de InformaciónRESUMEN
BACKGROUND: As an important task in bioinformatics, clustering analysis plays a critical role in understanding the functional mechanisms of many complex biological systems, which can be modeled as biological networks. The purpose of clustering analysis in biological networks is to identify functional modules of interest, but there is a lack of online clustering tools that visualize biological networks and provide in-depth biological analysis for discovered clusters. RESULTS: Here we present BioCAIV, a novel webserver dedicated to maximize its accessibility and applicability on the clustering analysis of biological networks. This, together with its user-friendly interface, assists biological researchers to perform an accurate clustering analysis for biological networks and identify functionally significant modules for further assessment. CONCLUSIONS: BioCAIV is an efficient clustering analysis webserver designed for a variety of biological networks. BioCAIV is freely available without registration requirements at http://bioinformatics.tianshanzw.cn:8888/BioCAIV/ .
Asunto(s)
Biología Computacional , Programas Informáticos , Análisis por ConglomeradosRESUMEN
BACKGROUND: Protein-protein interaction (PPI) plays an important role in regulating cells and signals. Despite the ongoing efforts of the bioassay group, continued incomplete data limits our ability to understand the molecular roots of human disease. Therefore, it is urgent to develop a computational method to predict PPIs from the perspective of molecular system. METHODS: In this paper, a highly efficient computational model, MTV-PPI, is proposed for PPI prediction based on a heterogeneous molecular network by learning inter-view protein sequences and intra-view interactions between molecules simultaneously. On the one hand, the inter-view feature is extracted from the protein sequence by k-mer method. On the other hand, we use a popular embedding method LINE to encode the heterogeneous molecular network to obtain the intra-view feature. Thus, the protein representation used in MTV-PPI is constructed by the aggregation of its inter-view feature and intra-view feature. Finally, random forest is integrated to predict potential PPIs. RESULTS: To prove the effectiveness of MTV-PPI, we conduct extensive experiments on a collected heterogeneous molecular network with the accuracy of 86.55%, sensitivity of 82.49%, precision of 89.79%, AUC of 0.9301 and AUPR of 0.9308. Further comparison experiments are performed with various protein representations and classifiers to indicate the effectiveness of MTV-PPI in predicting PPIs based on a complex network. CONCLUSION: The achieved experimental results illustrate that MTV-PPI is a promising tool for PPI prediction, which may provide a new perspective for the future interactions prediction researches based on heterogeneous molecular network.
Asunto(s)
Mapeo de Interacción de Proteínas , Proteínas , Secuencia de Aminoácidos , Biología Computacional/métodos , Humanos , Mapeo de Interacción de Proteínas/métodos , Proteínas/metabolismoRESUMEN
BACKGROUND: Identification of protein-protein interactions (PPIs) is crucial for understanding biological processes and investigating the cellular functions of genes. Self-interacting proteins (SIPs) are those in which more than two identical proteins can interact with each other and they are the specific type of PPIs. More and more researchers draw attention to the SIPs detection, and several prediction model have been proposed, but there are still some problems. Hence, there is an urgent need to explore a efficient computational model for SIPs prediction. RESULTS: In this study, we developed an effective model to predict SIPs, called RP-FIRF, which merges the Random Projection (RP) classifier and Finite Impulse Response Filter (FIRF) together. More specifically, each protein sequence was firstly transformed into the Position Specific Scoring Matrix (PSSM) by exploiting Position Specific Iterated BLAST (PSI-BLAST). Then, to effectively extract the discriminary SIPs feature to improve the performance of SIPs prediction, a FIRF method was used on PSSM. The R'classifier was proposed to execute the classification and predict novel SIPs. We evaluated the performance of the proposed RP-FIRF model and compared it with the state-of-the-art support vector machine (SVM) on human and yeast datasets, respectively. The proposed model can achieve high average accuracies of 97.89 and 97.35% using five-fold cross-validation. To further evaluate the high performance of the proposed method, we also compared it with other six exiting methods, the experimental results demonstrated that the capacity of our model surpass that of the other previous approaches. CONCLUSION: Experimental results show that self-interacting proteins are accurately well-predicted by the proposed model on human and yeast datasets, respectively. It fully show that the proposed model can predict the SIPs effectively and sufficiently. Thus, RP-FIRF model is an automatic decision support method which should provide useful insights into the recognition of SIPs.
Asunto(s)
Proteínas/metabolismo , Máquina de Vectores de Soporte , Área Bajo la Curva , Bases de Datos de Proteínas , Humanos , Análisis de Componente Principal , Mapas de Interacción de Proteínas , Proteínas/química , Curva ROC , Saccharomyces cerevisiae/metabolismo , Proteínas de Saccharomyces cerevisiae/química , Proteínas de Saccharomyces cerevisiae/metabolismoRESUMEN
OBJECTIVES: Human cytomegalovirus (HCMV) is an important pathogen causing morbidity and mortality in children. HCMV prevalence in children with respiratory infections has not been investigated in West China. Previous studies have suggested that glycoproteins genotypes may be associated with different clinical presentations, but the associations were controversial. The aim of this study was to determine the prevalence of HCMV infection in children with respiratory infections, the distributions of gB, gO genotypes among these isolates and their potential predictive roles for the development of symptoms in children. METHODS: A total of 1709 respiratory specimens were obtained from hospitalised children with respiratory symptoms from 2009 to 2014 for the confirmation of HCMV infection. Glycoprotein B,O genotyping was carried out by multiplex nested PCR and sequencing. RESULTS: The overall infection rate was 10.8%, and dominant genotypes were gB1 (74.2%) and gO1 (37.1%). Clinical characteristics differed between infants and children >1 year of age. Infants infected with HCMV had a higher frequency of fever (P < 0.001), cough (P < 0.001), rhinorrhea (P < 0.001), expectoration (P = 0.001) and diarrhoea (P = 0.005). Children <1 year age infected with gB1 had a higher rate of cough (P = 0.0192). CONCLUSIONS: Infants infected with HCMV had a severe clinical outcome. gB1 may negatively associate with clinical presentations and quality of life in these children. The prevalence of HCMV infection and genotype distribution emphasises the importance of HCMV screening, vaccination and control for transmission.
Asunto(s)
Niño Hospitalizado , Infecciones por Citomegalovirus/genética , Infecciones por Citomegalovirus/virología , Citomegalovirus/genética , Citomegalovirus/patogenicidad , Glicoproteínas/genética , Adolescente , Niño , Preescolar , China/epidemiología , Citomegalovirus/aislamiento & purificación , Infecciones por Citomegalovirus/epidemiología , ADN Viral/aislamiento & purificación , Femenino , Genotipo , Humanos , Lactante , Recién Nacido , Masculino , Reacción en Cadena de la Polimerasa , Prevalencia , Estaciones del AñoRESUMEN
OBJECTIVE: To investigate the epidemiological features and clinical features of human bocavirus (HBoV) infection in children with respiratory tract infection in Sichuan, and to analysis the HBoV VP1 gene mutation characteristics of Sichuan clinical strains. METHODS: Nasopharyngeal secretions were collected from 787 hospitalized children with respiratory tract infection. PCR was used to detect HBoV. The VP1 genetic variations of the nucleotide and amino acid were analysised respectively. RESULTS: Out of 787 specimens from respiratory tract, 8.26% (65/787) were positive for HBoV, 50.77% (33/65) were co-detected with other respiratory viruses. HBoV is usually detected in children under 3 years of age, the positive rate of male children was higher than female children. Most frequently clinical symptoms of HBoV were cough, fever and expectoration. Phylogenetic analyses showed that all the 8 clinical strains were HBoV1 genetype. GA+AG transitions were the most frequent transitions detected, while the nonsynonymous mutations were more than synonymous mutations. CONCLUSION: HBoV is an important pathogen of respiratory tract infection in children in Sichuan. The main type of nucleotide variation is transitions. Amino acids mutations may relate to immune evasion.
Asunto(s)
Variación Genética , Bocavirus Humano/genética , Infecciones del Sistema Respiratorio/virología , Niño , Femenino , Genotipo , Humanos , Masculino , Epidemiología Molecular , Nasofaringe/virología , Infecciones por Parvoviridae/virología , Filogenia , Reacción en Cadena de la PolimerasaRESUMEN
Cell type identification is an indispensable analytical step in single-cell data analyses. To address the high noise stemming from gene expression data, existing computational methods often overlook the biologically meaningful relationships between genes, opting to reduce all genes to a unified data space. We assume that such relationships can aid in characterizing cell type features and improving cell type recognition accuracy. To this end, we introduce scPriorGraph, a dual-channel graph neural network that integrates multi-level gene biosemantics. Experimental results demonstrate that scPriorGraph effectively aggregates feature values of similar cells using high-quality graphs, achieving state-of-the-art performance in cell type identification.
Asunto(s)
Análisis de la Célula Individual , Análisis de la Célula Individual/métodos , Humanos , Redes Neurales de la Computación , RNA-Seq/métodos , Biología Computacional/métodos , Algoritmos , Programas Informáticos , Análisis de Expresión Génica de una Sola CélulaRESUMEN
As post-transcriptional regulators of gene expression, micro-ribonucleic acids (miRNAs) are regarded as potential biomarkers for a variety of diseases. Hence, the prediction of miRNA-disease associations (MDAs) is of great significance for an in-depth understanding of disease pathogenesis and progression. Existing prediction models are mainly concentrated on incorporating different sources of biological information to perform the MDA prediction task while failing to consider the fully potential utility of MDA network information at the motif-level. To overcome this problem, we propose a novel motif-aware MDA prediction model, namely MotifMDA, by fusing a variety of high- and low-order structural information. In particular, we first design several motifs of interest considering their ability to characterize how miRNAs are associated with diseases through different network structural patterns. Then, MotifMDA adopts a two-layer hierarchical attention to identify novel MDAs. Specifically, the first attention layer learns high-order motif preferences based on their occurrences in the given MDA network, while the second one learns the final embeddings of miRNAs and diseases through coupling high- and low-order preferences. Experimental results on two benchmark datasets have demonstrated the superior performance of MotifMDA over several state-of-the-art prediction models. This strongly indicates that accurate MDA prediction can be achieved by relying solely on MDA network information. Furthermore, our case studies indicate that the incorporation of motif-level structure information allows MotifMDA to discover novel MDAs from different perspectives.
Asunto(s)
Biología Computacional , MicroARNs , MicroARNs/genética , Humanos , Biología Computacional/métodos , Predisposición Genética a la Enfermedad/genética , AlgoritmosRESUMEN
Identifying protein targets for drugs establishes an indispensable knowledge foundation for drug repurposing and drug development. Though expensive and time-consuming, vitro trials are widely employed to discover drug targets, and the existing relevant computational algorithms still cannot satisfy the demand for real application in drug R&D with regards to the prediction accuracy and performance efficiency, which are urgently needed to be improved. To this end, we propose here the PPAEDTI model, which uses the graph personalized propagation technique to predict drug-target interactions from the known interaction network. To evaluate the prediction performance, six benchmark datasets were used for testing with some state-of-the-art methods compared. As a result, using the 5-fold cross-validation, the proposed PPAEDTI model achieves average AUCs>90% on 5 collected datasets. We also manually checked the top-20 prediction list for 2 proteins (hsa:775 and hsa:779) and a kind of drug (D00618), and successfully confirmed 18, 17, and 20 items from the public datasets, respectively. The experimental results indicate that, given known drug-target interactions, the PPAEDTI model can provide accurate predictions for the new ones, which is anticipated to serve as a useful tool for pharmacology research. Using the proposed model that was trained with the collected datasets, we have built a computational platform that is accessible at http://120.77.11.78/PPAEDTI/ and corresponding codes and datasets are also released.
Asunto(s)
Algoritmos , Reposicionamiento de Medicamentos , Humanos , Interacciones Farmacológicas , Área Bajo la Curva , Proteínas/metabolismoRESUMEN
Recently, the role of competing endogenous RNAs in regulating gene expression through the interaction of microRNAs has been closely associated with the expression of circular RNAs (circRNAs) in various biological processes such as reproduction and apoptosis. While the number of confirmed circRNA-miRNA interactions (CMIs) continues to increase, the conventional in vitro approaches for discovery are expensive, labor intensive, and time consuming. Therefore, there is an urgent need for effective prediction of potential CMIs through appropriate data modeling and prediction based on known information. In this study, we proposed a novel model, called DeepCMI, that utilizes multi-source information on circRNA/miRNA to predict potential CMIs. Comprehensive evaluations on the CMI-9905 and CMI-9589 datasets demonstrated that DeepCMI successfully infers potential CMIs. Specifically, DeepCMI achieved AUC values of 90.54% and 94.8% on the CMI-9905 and CMI-9589 datasets, respectively. These results suggest that DeepCMI is an effective model for predicting potential CMIs and has the potential to significantly reduce the need for downstream in vitro studies. To facilitate the use of our trained model and data, we have constructed a computational platform, which is available at http://120.77.11.78/DeepCMI/. The source code and datasets used in this work are available at https://github.com/LiYuechao1998/DeepCMI.