Using Sequence Similarity Based on CKSNP Features and a Graph Neural Network Model to Identify miRNA-Disease Associations.
Ontology highlight
ABSTRACT:
SUBMITTER: Li M
PROVIDER: S-EPMC9602123 | biostudies-literature | 2022 Sep
REPOSITORIES: biostudies-literature
Publications
Using Sequence Similarity Based on CKSNP Features and a Graph Neural Network Model to Identify miRNA-Disease Associations.
Li Mingxin M Fan Yu Y Zhang Yiting Y Lv Zhibin Z
Genes 20220928 10
Among many machine learning models for analyzing the relationship between miRNAs and diseases, the prediction results are optimized by establishing different machine learning models, and less attention is paid to the feature information contained in the miRNA sequence itself. This study focused on the impact of the different feature information of miRNA sequences on the relationship between miRNA and disease. It was found that when the graph neural network used was the same and the miRNA feature ...[more]
Similar Datasets
Project description:BackgroundMircoRNAs (miRNAs) play a central role in diverse biological processes of Camellia sinensis var.assamica (CSA) through their associations with target mRNAs, including CSA growth, development and stress response. However, although the experiment methods of CSA miRNA-target identifications are costly and time-consuming, few computational methods have been developed to tackle the CSA miRNA-target association prediction problem.ResultsIn this paper, we constructed a heterogeneous network for CSA miRNA and targets by integrating rich biological information, including a miRNA similarity network, a target similarity network, and a miRNA-target association network. We then proposed a deep learning framework of graph convolution networks with layer attention mechanism, named MTAGCN. In particular, MTAGCN uses the attention mechanism to combine embeddings of multiple graph convolution layers, employing the integrated embedding to score the unobserved CSA miRNA-target associations.DiscussionComprehensive experiment results on two tasks (balanced task and unbalanced task) demonstrated that our proposed model achieved better performance than the classic machine learning and existing graph convolution network-based methods. The analysis of these results could offer valuable information for understanding complex CSA miRNA-target association mechanisms and would make a contribution to precision plant breeding.
| S-EPMC9275082 | biostudies-literature
Project description:The bile salt export pump (BSEP) is a key transporter involved in the efflux of bile salts from hepatocytes to bile canaliculi. Inhibition of BSEP leads to the accumulation of bile salts within the hepatocytes, leading to possible cholestasis and drug-induced liver injury. Screening for and identification of chemicals that inhibit this transporter aid in understanding the safety liabilities of these chemicals. Moreover, computational approaches to identify BSEP inhibitors provide an alternative to the more resource-intensive, gold standard experimental approaches. Here, we used publicly available data to develop predictive machine learning models for the identification of potential BSEP inhibitors. Specifically, we analyzed the utility of a graph convolutional neural network (GCNN)-based approach in combination with multitask learning to identify BSEP inhibitors. Our analyses showed that the developed GCNN model performed better than the variable-nearest neighbor and Bayesian machine learning approaches, with a cross-validation receiver operating characteristic area under the curve of 0.86. In addition, we compared GCNN-based single-task and multitask models and evaluated their utility in addressing data limitation challenges commonly observed in bioactivity modeling. We found that multitask models performed better than single-task models and can be utilized to identify active molecules for targets with limited data availability. Overall, our developed multitask GCNN-based BSEP model provides a useful tool for prioritizing hits during early drug discovery and in risk assessment of chemicals.
| S-EPMC10286257 | biostudies-literature
Project description:LncRNA and miRNA are two non-coding RNA types that are popular in current research. LncRNA interacts with miRNA to regulate gene transcription, further affecting human health and disease. Accurate identification of lncRNA-miRNA interactions contributes to the in-depth study of the biological functions and mechanisms of non-coding RNA. However, relying on biological experiments to obtain interaction information is time-consuming and expensive. Considering the rapid accumulation of gene information and the few computational methods, it is urgent to supplement the effective computational models to predict lncRNA-miRNA interactions. In this work, we propose a heterogeneous graph inference method based on similarity network fusion (SNFHGILMI) to predict potential lncRNA-miRNA interactions. First, we calculated multiple similarity data, including lncRNA sequence similarity, miRNA sequence similarity, lncRNA Gaussian nuclear similarity, and miRNA Gaussian nuclear similarity. Second, the similarity network fusion method was employed to integrate the data and get the similarity network of lncRNA and miRNA. Then, we constructed a bipartite network by combining the known interaction network and similarity network of lncRNA and miRNA. Finally, the heterogeneous graph inference method was introduced to construct a prediction model. On the real dataset, the model SNFHGILMI achieved AUC of 0.9501 and 0.9426 ± 0.0035 based on LOOCV and 5-fold cross validation, respectively. Furthermore, case studies also demonstrate that SNFHGILMI is a high-performance prediction method that can accurately predict new lncRNA-miRNA interactions. The Matlab code and readme file of SNFHGILMI can be downloaded from https://github.com/cj-DaSE/SNFHGILMI.
| S-EPMC9050493 | biostudies-literature
Project description:Determination of sequence similarity is one of the major steps in computational phylogenetic studies. As we know, during evolutionary history, not only DNA mutations for individual nucleotide but also subsequent rearrangements occurred. It has been one of major tasks of computational biologists to develop novel mathematical descriptors for similarity analysis such that various mutation phenomena information would be involved simultaneously. In this paper, different from traditional methods (eg, nucleotide frequency, geometric representations) as bases for construction of mathematical descriptors, we construct novel mathematical descriptors based on graph theory. In particular, for each DNA sequence, we will set up a weighted directed graph. The adjacency matrix of the directed graph will be used to induce a representative vector for DNA sequence. This new approach measures similarity based on both ordering and frequency of nucleotides so that much more information is involved. As an application, the method is tested on a set of 0.9-kb mtDNA sequences of twelve different primate species. All output phylogenetic trees with various distance estimations have the same topology, and are generally consistent with the reported results from early studies, which proves the new method's efficiency; we also test the new method on a simulated data set, which shows our new method performs better than traditional global alignment method when subsequent rearrangements happen frequently during evolutionary history.
| S-EPMC3204935 | biostudies-literature
Project description:The interactions between circular RNAs (circRNAs) and microRNAs (miRNAs) have been shown to alter gene expression and regulate genes on diseases. Since traditional experimental methods are time-consuming and labor-intensive, most circRNA-miRNA interactions remain largely unknown. Developing computational approaches to large-scale explore the interactions between circRNAs and miRNAs can help bridge this gap. In this paper, we proposed a graph convolutional neural network-based approach named GCNCMI to predict the potential interactions between circRNAs and miRNAs. GCNCMI first mines the potential interactions of adjacent nodes in the graph convolutional neural network and then recursively propagates interaction information on the graph convolutional layers. Finally, it unites the embedded representations generated by each layer to make the final prediction. In the five-fold cross-validation, GCNCMI achieved the highest AUC of 0.9312 and the highest AUPR of 0.9412. In addition, the case studies of two miRNAs, hsa-miR-622 and hsa-miR-149-5p, showed that our model has a good effect on predicting circRNA-miRNA interactions. The code and data are available at https://github.com/csuhjhjhj/GCNCMI.
| S-EPMC9389118 | biostudies-literature
Project description:BackgroundLung cancer is a global disease with high lethality, with early screening being considerably helpful for improving the 5-year survival rate. Multimodality features in early screening imaging are an important part of the prediction for lung adenocarcinoma, and establishing a model for adenocarcinoma diagnosis based on multimodal features is an obvious clinical need. Through our practice and investigation, we found that graph neural networks (GNNs) are excellent platforms for multimodal feature fusion, and the data can be completed using the edge-generation network. Therefore, we propose a new lung adenocarcinoma multiclassification model based on multimodal features and an edge-generation network.MethodsAccording to a ratio of 80% to 20%, respectively, the dataset of 338 cases was divided into the training set and the test set through 5-fold cross-validation, and the distribution of the 2 sets was the same. First, the regions of interest (ROIs) cropped from computed tomography (CT) images were separately fed into convolutional neural networks (CNNs) and radiomics processing platforms. The results of the 2 parts were then input into a graph embedding representation network to obtain the fused feature vectors. Subsequently, a graph database based on the clinical and semantic features was established, and the data were supplemented by an edge-generation network, with the fused feature vectors being used as the input of the nodes. This enabled us to clearly understand where the information transmission of the GNN takes place and improves the interpretability of the model. Finally, the nodes were classified using GNNs.ResultsOn our dataset, the proposed method presented in this paper achieved superior results compared to traditional methods and showed some comparability with state-of-the-art methods for lung nodule classification. The results of our method are as follows: accuracy (ACC) =66.26% (±4.46%), area under the curve (AUC) =75.86% (±1.79%), F1-score =64.00% (±3.65%), and Matthews correlation coefficient (MCC) =48.40% (±5.07%). The model with the edge-generating network consistently outperformed the model without it in all aspects.ConclusionsThe experiments demonstrate that with appropriate data=construction methods GNNs can outperform traditional image processing methods in the field of CT-based medical image classification. Additionally, our model has higher interpretability, as it employs subjective clinical and semantic features as the data construction approach. This will help doctors better leverage human-computer interactions.
| S-EPMC10423350 | biostudies-literature
Project description:BackgroundMany studies prove that miRNAs have significant roles in diagnosing and treating complex human diseases. However, conventional biological experiments are too costly and time-consuming to identify unconfirmed miRNA-disease associations. Thus, computational models predicting unidentified miRNA-disease pairs in an efficient way are becoming promising research topics. Although existing methods have performed well to reveal unidentified miRNA-disease associations, more work is still needed to improve prediction performance.ResultsIn this work, we present a novel multiple meta-paths fusion graph embedding model to predict unidentified miRNA-disease associations (M2GMDA). Our method takes full advantage of the complex structure and rich semantic information of miRNA-disease interactions in a self-learning way. First, a miRNA-disease heterogeneous network was derived from verified miRNA-disease pairs, miRNA similarity and disease similarity. All meta-path instances connecting miRNAs with diseases were extracted to describe intrinsic information about miRNA-disease interactions. Then, we developed a graph embedding model to predict miRNA-disease associations. The model is composed of linear transformations of miRNAs and diseases, the means encoder of a single meta-path instance, the attention-aware encoder of meta-path type and attention-aware multiple meta-path fusion. We innovatively integrated meta-path instances, meta-path based neighbours, intermediate nodes in meta-paths and more information to strengthen the prediction in our model. In particular, distinct contributions of different meta-path instances and meta-path types were combined with attention mechanisms. The data sets and source code that support the findings of this study are available at https://github.com/dangdangzhang/M2GMDA .ConclusionsM2GMDA achieved AUCs of 0.9323 and 0.9182 in global leave-one-out cross validation and fivefold cross validation with HDMM V2.0. The results showed that our method outperforms other prediction methods. Three kinds of case studies with lung neoplasms, breast neoplasms, prostate neoplasms, pancreatic neoplasms, lymphoma and colorectal neoplasms demonstrated that 47, 50, 49, 48, 50 and 50 out of the top 50 candidate miRNAs predicted by M2GMDA were validated by biological experiments. Therefore, it further confirms the prediction performance of our method.
| S-EPMC7579830 | biostudies-literature
Project description:Aberrant expressions of long non-coding RNAs (lncRNAs) are often associated with diseases and identification of disease-related lncRNAs is helpful for elucidating complex pathogenesis. Recent methods for predicting associations between lncRNAs and diseases integrate their pertinent heterogeneous data. However, they failed to deeply integrate topological information of heterogeneous network comprising lncRNAs, diseases, and miRNAs. We proposed a novel method based on the graph convolutional network and convolutional neural network, referred to as GCNLDA, to infer disease-related lncRNA candidates. The heterogeneous network containing the lncRNA, disease, and miRNA nodes, is constructed firstly. The embedding matrix of a lncRNA-disease node pair was constructed according to various biological premises about lncRNAs, diseases, and miRNAs. A new framework based on a graph convolutional network and a convolutional neural network was developed to learn network and local representations of the lncRNA-disease pair. On the left side of the framework, the autoencoder based on graph convolution deeply integrated topological information within the heterogeneous lncRNA-disease-miRNA network. Moreover, as different node features have discriminative contributions to the association prediction, an attention mechanism at node feature level is constructed. The left side learnt the network representation of the lncRNA-disease pair. The convolutional neural networks on the right side of the framework learnt the local representation of the lncRNA-disease pair by focusing on the similarities, associations, and interactions that are only related to the pair. Compared to several state-of-the-art prediction methods, GCNLDA had superior performance. Case studies on stomach cancer, osteosarcoma, and lung cancer confirmed that GCNLDA effectively discovers the potential lncRNA-disease associations.
| S-EPMC6769579 | biostudies-literature
Project description:BackgroundDrug repositioning has the potential to reduce costs and accelerate the rate of drug development, with highly promising applications. Currently, the development of artificial intelligence has provided the field with fast and efficient computing power. Nevertheless, the repositioning of traditional Chinese medicine (TCM) is still in its infancy, and the establishment of a reasonable and effective research method is a pressing issue that requires urgent attention. The use of graph neural network (GNN) to compute the similarity between TCM prescriptions to develop a method for finding their new indications is an innovative attempt.MethodsThis paper focused on traditional Chinese medicine prescriptions containing ephedra, with 20 prescriptions for treating external cough and asthma taken as target prescriptions. The remaining 67 prescriptions containing ephedra were taken as to-be-matched prescriptions. Furthermore, a multitude of data pertaining to the prescriptions, including diseases, disease targets, symptoms, and various types of information on herbs, was gathered from a diverse array of literature sources, such as Chinese medicine databases. Then, cosine similarity and Jaccard coefficient were calculated to characterize the similarity between prescriptions using graph convolutional network (GCN) with a self-supervised learning method, such as deep graph infomax (DGI).ResultsA total of 1340 values were obtained for each of the two calculation indicators. A total of 68 prescription pairs were identified after screening with 0.77 as the threshold for cosine similarity. Following the removal of false positive results, 12 prescription pairs were deemed to have further research value. A total of 5 prescription pairs were screened using a threshold of 0.50 for the Jaccard coefficient. However, the specific results did not exhibit significant value for further use, which may be attributed to the excessive variety of information in the dataset.ConclusionsThe proposed method can provide reference for finding new indications of target prescriptions by quantifying the similarity between prescriptions. It is expected to offer new insights for developing a scientific and systematic research methodology for traditional Chinese medicine repositioning.
| S-EPMC11391787 | biostudies-literature
Project description:BackgroundSubtle, prognostically important ECG features may not be apparent to physicians. In the course of supervised machine learning, thousands of ECG features are identified. These are not limited to conventional ECG parameters and morphology. We aimed to investigate whether neural network-derived ECG features could be used to predict future cardiovascular disease and mortality and have phenotypic and genotypic associations.MethodsWe extracted 5120 neural network-derived ECG features from an artificial intelligence-enabled ECG model trained for 6 simple diagnoses and applied unsupervised machine learning to identify 3 phenogroups. Using the identified phenogroups, we externally validated our findings in 5 diverse cohorts from the United States, Brazil, and the United Kingdom. Data were collected between 2000 and 2023.ResultsIn total, 1 808 584 patients were included in this study. In the derivation cohort, the 3 phenogroups had significantly different mortality profiles. After adjusting for known covariates, phenogroup B had a 20% increase in long-term mortality compared with phenogroup A (hazard ratio, 1.20 [95% CI, 1.17-1.23]; P<0.0001; phenogroup A mortality, 2.2%; phenogroup B mortality, 6.1%). In univariate analyses, we found phenogroup B had a significantly greater risk of mortality in all cohorts (log-rank P<0.01 in all 5 cohorts). Phenome-wide association study showed phenogroup B had a higher rate of future atrial fibrillation (odds ratio, 2.89; P<0.00001), ventricular tachycardia (odds ratio, 2.00; P<0.00001), ischemic heart disease (odds ratio, 1.44; P<0.00001), and cardiomyopathy (odds ratio, 2.04; P<0.00001). A single-trait genome-wide association study yielded 4 loci. SCN10A, SCN5A, and CAV1 have roles in cardiac conduction and arrhythmia. ARHGAP24 does not have a clear cardiac role and may be a novel target.ConclusionsNeural network-derived ECG features can be used to predict all-cause mortality and future cardiovascular diseases. We have identified biologically plausible and novel phenotypic and genotypic associations that describe mechanisms for the increased risk identified.
| S-EPMC7616866 | biostudies-literature