Pub Date : 2024-03-01Epub Date: 2024-01-06DOI: 10.1007/s12539-023-00596-6
Shiyu Yan, Ding Zheng
The exploration of drug combinations presents an opportunity to amplify therapeutic effectiveness while alleviating undesirable side effects. Nevertheless, the extensive array of potential combinations poses challenges in terms of cost and time constraints for experimental screening. Thus, it is crucial to narrow down the search space. Deep learning approaches have gained widespread popularity in predicting synergistic drug combinations tailored for specific cell lines in vitro settings. In the present study, we introduce a novel method termed GTextSyn, which utilizes the integration of gene expression data and chemical structure information for the prediction of synergistic effects in drug combinations. GTextSyn employs a sentence classification model within the domain of Natural Language Processing (NLP), wherein drugs and cell lines are regarded as entities possessing biochemical relevance. Meanwhile, combinations of drug pairs and cell lines are construed as sentences with biochemical relational significance. To assess the efficacy of GTextSyn, we conduct a comparative analysis with alternative deep learning approaches using a standard benchmark dataset. The results from a five-fold cross-validation demonstrate a 49.5% reduction in Mean Square Error (MSE) achieved by GTextSyn, surpassing the performance of the next best method in the regression task. Furthermore, we conduct a comprehensive literature survey on the predicted novel drug combinations and find substantial support from prior experimental studies for many of the combinations identified by GTextSyn.
{"title":"A Deep Neural Network for Predicting Synergistic Drug Combinations on Cancer.","authors":"Shiyu Yan, Ding Zheng","doi":"10.1007/s12539-023-00596-6","DOIUrl":"10.1007/s12539-023-00596-6","url":null,"abstract":"<p><p>The exploration of drug combinations presents an opportunity to amplify therapeutic effectiveness while alleviating undesirable side effects. Nevertheless, the extensive array of potential combinations poses challenges in terms of cost and time constraints for experimental screening. Thus, it is crucial to narrow down the search space. Deep learning approaches have gained widespread popularity in predicting synergistic drug combinations tailored for specific cell lines in vitro settings. In the present study, we introduce a novel method termed GTextSyn, which utilizes the integration of gene expression data and chemical structure information for the prediction of synergistic effects in drug combinations. GTextSyn employs a sentence classification model within the domain of Natural Language Processing (NLP), wherein drugs and cell lines are regarded as entities possessing biochemical relevance. Meanwhile, combinations of drug pairs and cell lines are construed as sentences with biochemical relational significance. To assess the efficacy of GTextSyn, we conduct a comparative analysis with alternative deep learning approaches using a standard benchmark dataset. The results from a five-fold cross-validation demonstrate a 49.5% reduction in Mean Square Error (MSE) achieved by GTextSyn, surpassing the performance of the next best method in the regression task. Furthermore, we conduct a comprehensive literature survey on the predicted novel drug combinations and find substantial support from prior experimental studies for many of the combinations identified by GTextSyn.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"218-230"},"PeriodicalIF":4.8,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139110865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01Epub Date: 2023-09-30DOI: 10.1007/s12539-023-00586-8
Rui Zhen Tan
In cancer treatment, adaptive therapy holds promise for delaying the onset of recurrence through regulating the competition between drug-sensitive and drug-resistant cells. Adaptive therapy has been studied in well-mixed models assuming free mixing of all cells and spatial models considering the interactions of single cells with their immediate adjacent cells. Both models do not reflect the spatial structure in glandular tumours where intra-gland cellular interaction is high, while inter-gland interaction is limited. Here, we use mathematical modelling to study the effects of adaptive therapy on glandular tumours that expand using either glandular fission or invasive growth. A two-dimensional, lattice-based model of sites containing sensitive and resistant cells within individual glands is developed to study the evolution of glandular tumour cells under continuous and adaptive therapies. We found that although both growth models benefit from adaptive therapy's ability to prevent recurrence, invasive growth benefits more from it than fission growth. This difference is due to the migration of daughter cells into neighboring glands that is absent in fission but present in invasive growth. The migration resulted in greater mixing of cells, enhancing competition induced by adaptive therapy. By varying the initial spatial spread and location of the resistant cells within the tumour, we found that modifying the conditions within the resistant cells containing glands affect both fission and invasive growth. However, modifying the conditions surrounding these glands affect invasive growth only. Our work reveals the interplay between growth mechanism and tumour topology in modulating the effectiveness of cancer therapy.
{"title":"Tumour Growth Mechanisms Determine Effectiveness of Adaptive Therapy in Glandular Tumours.","authors":"Rui Zhen Tan","doi":"10.1007/s12539-023-00586-8","DOIUrl":"10.1007/s12539-023-00586-8","url":null,"abstract":"<p><p>In cancer treatment, adaptive therapy holds promise for delaying the onset of recurrence through regulating the competition between drug-sensitive and drug-resistant cells. Adaptive therapy has been studied in well-mixed models assuming free mixing of all cells and spatial models considering the interactions of single cells with their immediate adjacent cells. Both models do not reflect the spatial structure in glandular tumours where intra-gland cellular interaction is high, while inter-gland interaction is limited. Here, we use mathematical modelling to study the effects of adaptive therapy on glandular tumours that expand using either glandular fission or invasive growth. A two-dimensional, lattice-based model of sites containing sensitive and resistant cells within individual glands is developed to study the evolution of glandular tumour cells under continuous and adaptive therapies. We found that although both growth models benefit from adaptive therapy's ability to prevent recurrence, invasive growth benefits more from it than fission growth. This difference is due to the migration of daughter cells into neighboring glands that is absent in fission but present in invasive growth. The migration resulted in greater mixing of cells, enhancing competition induced by adaptive therapy. By varying the initial spatial spread and location of the resistant cells within the tumour, we found that modifying the conditions within the resistant cells containing glands affect both fission and invasive growth. However, modifying the conditions surrounding these glands affect invasive growth only. Our work reveals the interplay between growth mechanism and tumour topology in modulating the effectiveness of cancer therapy.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"73-90"},"PeriodicalIF":4.8,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41111338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Vascular disease is one of the major causes of death worldwide. Endothelial cells are important components of the vascular structure. A better understanding of the endothelial cell changes in the development of vascular disease may provide new targets for clinical treatment strategies. Single-cell RNA sequencing can serve as a powerful tool to explore transcription patterns, as well as cell type identity. Our current study is based on comprehensive scRNA-seq data of several types of human vascular disease datasets with deep-learning-based algorithm. A gene set scoring system, created based on cell clustering, may help to identify the relative stage of the development of vascular disease. Metabolic preference patterns were estimated using a graphic neural network model. Overall, our study may provide potential treatment targets for retaining normal endothelial function under pathological situations.
{"title":"Comprehensive scRNA-seq Model Reveals Artery Endothelial Cell Heterogeneity and Metabolic Preference in Human Vascular Disease.","authors":"Liping Zeng, Yunchang Liu, Xiaoping Li, Xue Gong, Miao Tian, Peili Yang, Qi Cai, Gengze Wu, Chunyu Zeng","doi":"10.1007/s12539-023-00591-x","DOIUrl":"10.1007/s12539-023-00591-x","url":null,"abstract":"<p><p>Vascular disease is one of the major causes of death worldwide. Endothelial cells are important components of the vascular structure. A better understanding of the endothelial cell changes in the development of vascular disease may provide new targets for clinical treatment strategies. Single-cell RNA sequencing can serve as a powerful tool to explore transcription patterns, as well as cell type identity. Our current study is based on comprehensive scRNA-seq data of several types of human vascular disease datasets with deep-learning-based algorithm. A gene set scoring system, created based on cell clustering, may help to identify the relative stage of the development of vascular disease. Metabolic preference patterns were estimated using a graphic neural network model. Overall, our study may provide potential treatment targets for retaining normal endothelial function under pathological situations.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"104-122"},"PeriodicalIF":4.8,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136397280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01Epub Date: 2023-12-07DOI: 10.1007/s12539-023-00592-w
Yanting Liu, Hao Wang, Yanrui Ding
Autism spectrum disorder (ASD) is a neurological and developmental disorder and its early diagnosis is a challenging task. The dynamic brain network (DBN) offers a wealth of information for the diagnosis and treatment of ASD. Mining the spatio-temporal characteristics of DBN is critical for finding dynamic communication across brain regions and, ultimately, identifying the ASD diagnostic biomarker. We proposed the dgEmbed-KNN and the Aggregation-SVM diagnostic models, which use the spatio-temporal information from DBN and interactive information among brain regions represented by dynamic graph embedding. The classification accuracies show that dgEmbed-KNN model performs slightly better than traditional machine learning and deep learning methods, while the Aggregation-SVM model has a very good capacity to diagnose ASD using aggregation brain network connections as features. We discovered over- and under-connections in ASD at the level of dynamic connections, involving brain regions of the postcentral gyrus, the insula, the cerebellum, the caudate nucleus, and the temporal pole. We also found abnormal dynamic interactions associated with ASD within/between the functional subnetworks, including default mode network, visual network, auditory network and saliency network. These can provide potential DBN biomarkers for ASD identification.
{"title":"The Dynamical Biomarkers in Functional Connectivity of Autism Spectrum Disorder Based on Dynamic Graph Embedding.","authors":"Yanting Liu, Hao Wang, Yanrui Ding","doi":"10.1007/s12539-023-00592-w","DOIUrl":"10.1007/s12539-023-00592-w","url":null,"abstract":"<p><p>Autism spectrum disorder (ASD) is a neurological and developmental disorder and its early diagnosis is a challenging task. The dynamic brain network (DBN) offers a wealth of information for the diagnosis and treatment of ASD. Mining the spatio-temporal characteristics of DBN is critical for finding dynamic communication across brain regions and, ultimately, identifying the ASD diagnostic biomarker. We proposed the dgEmbed-KNN and the Aggregation-SVM diagnostic models, which use the spatio-temporal information from DBN and interactive information among brain regions represented by dynamic graph embedding. The classification accuracies show that dgEmbed-KNN model performs slightly better than traditional machine learning and deep learning methods, while the Aggregation-SVM model has a very good capacity to diagnose ASD using aggregation brain network connections as features. We discovered over- and under-connections in ASD at the level of dynamic connections, involving brain regions of the postcentral gyrus, the insula, the cerebellum, the caudate nucleus, and the temporal pole. We also found abnormal dynamic interactions associated with ASD within/between the functional subnetworks, including default mode network, visual network, auditory network and saliency network. These can provide potential DBN biomarkers for ASD identification.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"141-159"},"PeriodicalIF":4.8,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138498321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01Epub Date: 2023-08-26DOI: 10.1007/s12539-023-00583-x
Yuqi Zhang, Mengbo Yu, Chao Tong, Yanqing Zhao, Jintao Han
Stroke is still the World's second major factor of death, as well as the third major factor of death and disability. Ischemic stroke is a type of stroke, in which early detection and treatment are the keys to preventing ischemic strokes. However, due to the limitation of privacy protection and labeling difficulties, there are only a few studies on the intelligent automatic diagnosis of stroke or ischemic stroke, and the results are unsatisfactory. Therefore, we collect some data and propose a 3D carotid Computed Tomography Angiography (CTA) image segmentation model called CA-UNet for fully automated extraction of carotid arteries. We explore the number of down-sampling times applicable to carotid segmentation and design a multi-scale loss function to resolve the loss of detailed features during the process of down-sampling. Moreover, based on CA-Unet, we propose an ischemic stroke risk prediction model to predict the risk in patients using their 3D CTA images, electronic medical records, and medical history. We have validated the efficacy of our segmentation model and prediction model through comparison tests. Our method can provide reliable diagnoses and results that benefit patients and medical professionals.
{"title":"CA-UNet Segmentation Makes a Good Ischemic Stroke Risk Prediction.","authors":"Yuqi Zhang, Mengbo Yu, Chao Tong, Yanqing Zhao, Jintao Han","doi":"10.1007/s12539-023-00583-x","DOIUrl":"10.1007/s12539-023-00583-x","url":null,"abstract":"<p><p>Stroke is still the World's second major factor of death, as well as the third major factor of death and disability. Ischemic stroke is a type of stroke, in which early detection and treatment are the keys to preventing ischemic strokes. However, due to the limitation of privacy protection and labeling difficulties, there are only a few studies on the intelligent automatic diagnosis of stroke or ischemic stroke, and the results are unsatisfactory. Therefore, we collect some data and propose a 3D carotid Computed Tomography Angiography (CTA) image segmentation model called CA-UNet for fully automated extraction of carotid arteries. We explore the number of down-sampling times applicable to carotid segmentation and design a multi-scale loss function to resolve the loss of detailed features during the process of down-sampling. Moreover, based on CA-Unet, we propose an ischemic stroke risk prediction model to predict the risk in patients using their 3D CTA images, electronic medical records, and medical history. We have validated the efficacy of our segmentation model and prediction model through comparison tests. Our method can provide reliable diagnoses and results that benefit patients and medical professionals.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"58-72"},"PeriodicalIF":4.8,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10448784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01Epub Date: 2023-10-10DOI: 10.1007/s12539-023-00587-7
Yaxin Xu, Wei Zhang, Xiaoying Zheng, Xianxian Cai
Single-cell RNA sequencing technology is one of the most cost-effective ways to uncover transcriptomic heterogeneity. With the rapid rise of this technology, enormous amounts of scRNA-seq data have been produced. Due to the high dimensionality, noise, sparsity and missing features of the available scRNA-seq data, accurately clustering the scRNA-seq data for downstream analysis is a significant challenge. Many computational methods have been designed to address this issue; nevertheless, the efficacy of the available methods is still inadequate. In addition, most similarity-based methods require a number of clusters as input, which is difficult to achieve in real applications. In this study, we developed a novel computational method for clustering scRNA-seq data by considering both global and local information, named GCFG. This method characterizes the global properties of data by applying concept factorization, and the regularized Gaussian graphical model is utilized to evaluate the local embedding relationship of data. To learn the cell-cell similarity matrix, we integrated the two components, and an iterative optimization algorithm was developed. The categorization of single cells is obtained by applying Louvain, a modularity-based community discovery algorithm, to the similarity matrix. The behavior of the GCFG approach is assessed on 14 real scRNA-seq datasets in terms of ACC and ARI, and comparison results with 17 other competitive methods suggest that GCFG is effective and robust.
{"title":"Combining Global-Constrained Concept Factorization and a Regularized Gaussian Graphical Model for Clustering Single-Cell RNA-seq Data.","authors":"Yaxin Xu, Wei Zhang, Xiaoying Zheng, Xianxian Cai","doi":"10.1007/s12539-023-00587-7","DOIUrl":"10.1007/s12539-023-00587-7","url":null,"abstract":"<p><p>Single-cell RNA sequencing technology is one of the most cost-effective ways to uncover transcriptomic heterogeneity. With the rapid rise of this technology, enormous amounts of scRNA-seq data have been produced. Due to the high dimensionality, noise, sparsity and missing features of the available scRNA-seq data, accurately clustering the scRNA-seq data for downstream analysis is a significant challenge. Many computational methods have been designed to address this issue; nevertheless, the efficacy of the available methods is still inadequate. In addition, most similarity-based methods require a number of clusters as input, which is difficult to achieve in real applications. In this study, we developed a novel computational method for clustering scRNA-seq data by considering both global and local information, named GCFG. This method characterizes the global properties of data by applying concept factorization, and the regularized Gaussian graphical model is utilized to evaluate the local embedding relationship of data. To learn the cell-cell similarity matrix, we integrated the two components, and an iterative optimization algorithm was developed. The categorization of single cells is obtained by applying Louvain, a modularity-based community discovery algorithm, to the similarity matrix. The behavior of the GCFG approach is assessed on 14 real scRNA-seq datasets in terms of ACC and ARI, and comparison results with 17 other competitive methods suggest that GCFG is effective and robust.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"1-15"},"PeriodicalIF":4.8,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41182531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01Epub Date: 2024-01-31DOI: 10.1007/s12539-023-00600-z
Xiaosong Wang, Guojun Chen, Hang Hu, Min Zhang, Yuan Rao, Zhenyu Yue
The precise identification of associations between diseases and drugs is paramount for comprehending the etiology and mechanisms underlying parasitic diseases. Computational approaches are highly effective in discovering and predicting disease-drug associations. However, the majority of these approaches primarily rely on link-based methodologies within distinct biomedical bipartite networks. In this study, we reorganized a fundamental dataset of parasitic disease-drug associations using the latest databases, and proposed a prediction model called PDDGCN, based on a multi-view graph convolutional network. To begin with, we fused similarity networks with binary networks to establish multi-view heterogeneous networks. We utilized neighborhood information aggregation layers to refine node embeddings within each view of the multi-view heterogeneous networks, leveraging inter- and intra-domain message passing to aggregate information from neighboring nodes. Subsequently, we integrated multiple embeddings from each view and fed them into the ultimate discriminator. The experimental results demonstrate that PDDGCN outperforms five state-of-the-art methods and four compared machine learning algorithms. Additionally, case studies have substantiated the effectiveness of PDDGCN in identifying associations between parasitic diseases and drugs. In summary, the PDDGCN model has the potential to facilitate the discovery of potential treatments for parasitic diseases and advance our comprehension of the etiology in this field. The source code is available at https://github.com/AhauBioinformatics/PDDGCN .
{"title":"PDDGCN: A Parasitic Disease-Drug Association Predictor Based on Multi-view Fusion Graph Convolutional Network.","authors":"Xiaosong Wang, Guojun Chen, Hang Hu, Min Zhang, Yuan Rao, Zhenyu Yue","doi":"10.1007/s12539-023-00600-z","DOIUrl":"10.1007/s12539-023-00600-z","url":null,"abstract":"<p><p>The precise identification of associations between diseases and drugs is paramount for comprehending the etiology and mechanisms underlying parasitic diseases. Computational approaches are highly effective in discovering and predicting disease-drug associations. However, the majority of these approaches primarily rely on link-based methodologies within distinct biomedical bipartite networks. In this study, we reorganized a fundamental dataset of parasitic disease-drug associations using the latest databases, and proposed a prediction model called PDDGCN, based on a multi-view graph convolutional network. To begin with, we fused similarity networks with binary networks to establish multi-view heterogeneous networks. We utilized neighborhood information aggregation layers to refine node embeddings within each view of the multi-view heterogeneous networks, leveraging inter- and intra-domain message passing to aggregate information from neighboring nodes. Subsequently, we integrated multiple embeddings from each view and fed them into the ultimate discriminator. The experimental results demonstrate that PDDGCN outperforms five state-of-the-art methods and four compared machine learning algorithms. Additionally, case studies have substantiated the effectiveness of PDDGCN in identifying associations between parasitic diseases and drugs. In summary, the PDDGCN model has the potential to facilitate the discovery of potential treatments for parasitic diseases and advance our comprehension of the etiology in this field. The source code is available at https://github.com/AhauBioinformatics/PDDGCN .</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"231-242"},"PeriodicalIF":4.8,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139642076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01Epub Date: 2023-11-17DOI: 10.1007/s12539-023-00590-y
Hacer Turgut, Beste Turanli, Betül Boz
Circular RNA is a single-stranded RNA with a closed-loop structure. In recent years, academic research has revealed that circular RNAs play critical roles in biological processes and are related to human diseases. The discovery of potential circRNAs as disease biomarkers and drug targets is crucial since it can help diagnose diseases in the early stages and be used to treat people. However, in conventional experimental methods, conducting experiments to detect associations between circular RNAs and diseases is time-consuming and costly. To overcome this problem, various computational methodologies are proposed to extract essential features for both circular RNAs and diseases and predict the associations. Studies showed that computational methods successfully predicted performance and made it possible to detect possible highly related circular RNAs for diseases. This study proposes a deep learning-based circRNA-disease association predictor methodology called DCDA, which uses multiple data sources to create circRNA and disease features and reveal hidden feature codings of a circular RNA-disease pair with a deep autoencoder, then predict the relation score of the pair by a deep neural network. Fivefold cross-validation results on the benchmark dataset showed that our model outperforms state-of-the-art prediction methods in the literature with the AUC score of 0.9794.
{"title":"DCDA: CircRNA-Disease Association Prediction with Feed-Forward Neural Network and Deep Autoencoder.","authors":"Hacer Turgut, Beste Turanli, Betül Boz","doi":"10.1007/s12539-023-00590-y","DOIUrl":"10.1007/s12539-023-00590-y","url":null,"abstract":"<p><p>Circular RNA is a single-stranded RNA with a closed-loop structure. In recent years, academic research has revealed that circular RNAs play critical roles in biological processes and are related to human diseases. The discovery of potential circRNAs as disease biomarkers and drug targets is crucial since it can help diagnose diseases in the early stages and be used to treat people. However, in conventional experimental methods, conducting experiments to detect associations between circular RNAs and diseases is time-consuming and costly. To overcome this problem, various computational methodologies are proposed to extract essential features for both circular RNAs and diseases and predict the associations. Studies showed that computational methods successfully predicted performance and made it possible to detect possible highly related circular RNAs for diseases. This study proposes a deep learning-based circRNA-disease association predictor methodology called DCDA, which uses multiple data sources to create circRNA and disease features and reveal hidden feature codings of a circular RNA-disease pair with a deep autoencoder, then predict the relation score of the pair by a deep neural network. Fivefold cross-validation results on the benchmark dataset showed that our model outperforms state-of-the-art prediction methods in the literature with the AUC score of 0.9794.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"91-103"},"PeriodicalIF":4.8,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136397281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-04DOI: 10.1007/s12539-023-00602-x
Weicheng Sun, Ping Zhang, Weihan Zhang, Jinsheng Xu, Yanrong Huang, Li Li
MicroRNA (miRNA) serves as a pivotal regulator of numerous cellular processes, and the identification of miRNA-disease associations (MDAs) is crucial for comprehending complex diseases. Recently, graph neural networks (GNN) have made significant advancements in MDA prediction. However, these methods tend to learn one type of node representation from a single heterogeneous network, ignoring the importance of multiple network topologies and node attributes. Here, we propose SMDAP (Sequence hierarchical modeling-based Mirna-Disease Association Prediction framework), a novel GNN-based framework that incorporates multiple network topologies and various node attributes including miRNA seed and full-length sequences to predict potential MDAs. Specifically, SMDAP consists of two types of MDA representation: following a heterogeneous pattern, we construct a transfer learning-like synchronous mutual learning network to learn the first MDA representation in conjunction with the miRNA seed sequence. Meanwhile, following a homogeneous pattern, we design a subgraph-inspired asynchronous multi-scale embedding network to obtain the second MDA representation based on the miRNA full-length sequence. Subsequently, an adaptive fusion approach is designed to combine the two branches such that we can score the MDAs by the downstream classifier and infer novel MDAs. Comprehensive experiments demonstrate that SMDAP integrates the advantages of multiple network topologies and node attributes into two branch representations. Moreover, the area under the receiver operating characteristic curve is 0.9622 on DB1, which is a 5.06% increase from the baselines. The area under the precision–recall curve is 0.9777, which is a 7.33% increase from the baselines. In addition, case studies on three human cancers validated the predictive performance of SMDAP. Overall, SMDAP represents a powerful tool for MDA prediction.
{"title":"Synchronous Mutual Learning Network and Asynchronous Multi-Scale Embedding Network for miRNA-Disease Association Prediction","authors":"Weicheng Sun, Ping Zhang, Weihan Zhang, Jinsheng Xu, Yanrong Huang, Li Li","doi":"10.1007/s12539-023-00602-x","DOIUrl":"https://doi.org/10.1007/s12539-023-00602-x","url":null,"abstract":"<p>MicroRNA (miRNA) serves as a pivotal regulator of numerous cellular processes, and the identification of miRNA-disease associations (MDAs) is crucial for comprehending complex diseases. Recently, graph neural networks (GNN) have made significant advancements in MDA prediction. However, these methods tend to learn one type of node representation from a single heterogeneous network, ignoring the importance of multiple network topologies and node attributes. Here, we propose SMDAP (Sequence hierarchical modeling-based Mirna-Disease Association Prediction framework), a novel GNN-based framework that incorporates multiple network topologies and various node attributes including miRNA seed and full-length sequences to predict potential MDAs. Specifically, SMDAP consists of two types of MDA representation: following a heterogeneous pattern, we construct a transfer learning-like synchronous mutual learning network to learn the first MDA representation in conjunction with the miRNA seed sequence. Meanwhile, following a homogeneous pattern, we design a subgraph-inspired asynchronous multi-scale embedding network to obtain the second MDA representation based on the miRNA full-length sequence. Subsequently, an adaptive fusion approach is designed to combine the two branches such that we can score the MDAs by the downstream classifier and infer novel MDAs. Comprehensive experiments demonstrate that SMDAP integrates the advantages of multiple network topologies and node attributes into two branch representations. Moreover, the area under the receiver operating characteristic curve is 0.9622 on DB1, which is a 5.06% increase from the baselines. The area under the precision–recall curve is 0.9777, which is a 7.33% increase from the baselines. In addition, case studies on three human cancers validated the predictive performance of SMDAP. Overall, SMDAP represents a powerful tool for MDA prediction.</p><h3 data-test=\"abstract-sub-heading\">Graphical Abstract</h3>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":"39 1","pages":""},"PeriodicalIF":4.8,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-16DOI: 10.1007/s12539-023-00593-9
Abstract
Drug repositioning is critical to drug development. Previous drug repositioning methods mainly constructed drug–disease heterogeneous networks to extract drug–disease features. However, these methods faced difficulty when we are using structurally simple models to deal with complex heterogeneous networks. Therefore, in this study, the researchers introduced a drug repositioning method named DRDSA. The method utilizes a deep sparse autoencoder and integrates drug–disease similarities. First, the researchers constructed a drug–disease feature network by incorporating information from drug chemical structure, disease semantic data, and existing known drug–disease associations. Then, we learned the low-dimensional representation of the feature network using a deep sparse autoencoder. Finally, we utilized a deep neural network to make predictions on new drug–disease associations based on the feature representation. The experimental results show that our proposed method has achieved optimal results on all four benchmark datasets, especially on the CTD dataset where AUC and AUPR reached 0.9619 and 0.9676, respectively, outperforming other baseline methods. In the case study, the researchers predicted the top ten antiviral drugs for COVID-19. Remarkably, six out of these predictions were subsequently validated by other literature sources.
Graphical Abstract
Schematic diagrams of data processing and DRDSA model. A Construction of drug and disease feature vectors, B The workflow of DRDSA model.
{"title":"Drug Repositioning Based on Deep Sparse Autoencoder and Drug–Disease Similarity","authors":"","doi":"10.1007/s12539-023-00593-9","DOIUrl":"https://doi.org/10.1007/s12539-023-00593-9","url":null,"abstract":"<h3>Abstract</h3> <p>Drug repositioning is critical to drug development. Previous drug repositioning methods mainly constructed drug–disease heterogeneous networks to extract drug–disease features. However, these methods faced difficulty when we are using structurally simple models to deal with complex heterogeneous networks. Therefore, in this study, the researchers introduced a drug repositioning method named DRDSA. The method utilizes a deep sparse autoencoder and integrates drug–disease similarities. First, the researchers constructed a drug–disease feature network by incorporating information from drug chemical structure, disease semantic data, and existing known drug–disease associations. Then, we learned the low-dimensional representation of the feature network using a deep sparse autoencoder. Finally, we utilized a deep neural network to make predictions on new drug–disease associations based on the feature representation. The experimental results show that our proposed method has achieved optimal results on all four benchmark datasets, especially on the CTD dataset where AUC and AUPR reached 0.9619 and 0.9676, respectively, outperforming other baseline methods. In the case study, the researchers predicted the top ten antiviral drugs for COVID-19. Remarkably, six out of these predictions were subsequently validated by other literature sources.</p> <span> <h3>Graphical Abstract</h3> <p>Schematic diagrams of data processing and DRDSA model. <strong>A</strong> Construction of drug and disease feature vectors, <strong>B</strong> The workflow of DRDSA model.<span> <span> <img alt=\"\" src=\"https://static-content.springer.com/image/MediaObjects/12539_2023_593_Figa_HTML.png\"/> </span> </span></p> </span>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":"3 1","pages":""},"PeriodicalIF":4.8,"publicationDate":"2023-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138691514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}