Pub Date : 2023-11-07DOI: 10.1142/s0219720023500257
Dmitriy Karpenko, Aleksei Bigildeev
{"title":"Small groups in multidimensional feature space: two examples of supervised two-group classification from biomedicine","authors":"Dmitriy Karpenko, Aleksei Bigildeev","doi":"10.1142/s0219720023500257","DOIUrl":"https://doi.org/10.1142/s0219720023500257","url":null,"abstract":"","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":"115 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135541469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-07DOI: 10.1142/s0219720023500269
Chengyou Li, Shiqiang Fan, Haiyong Zhao, Xiaotong Liu
{"title":"CNV-FB: A Feature bagging strategy-based approach to detect copy number variants from NGS data","authors":"Chengyou Li, Shiqiang Fan, Haiyong Zhao, Xiaotong Liu","doi":"10.1142/s0219720023500269","DOIUrl":"https://doi.org/10.1142/s0219720023500269","url":null,"abstract":"","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":"115 22","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135541468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01Epub Date: 2023-10-18DOI: 10.1142/S021972002350021X
Chao Li, Tianxiang Wang, Xiaohui Lin
Defining meaningful feature (molecule) combinations can enhance the study of disease diagnosis and prognosis. However, feature combinations are complex and various in biosystems, and the existing methods examine the feature cooperation in a single, fixed pattern for all feature pairs, such as linear combination. To identify the appropriate combination between two features and evaluate feature combination more comprehensively, this paper adopts kernel functions to study feature relationships and proposes a new omics data analysis method KF-[Formula: see text]-TSP. Besides linear combination, KF-[Formula: see text]-TSP also explores the nonlinear combination of features, and allows hybridizing multiple kernel functions to evaluate feature interaction from multiple views. KF-[Formula: see text]-TSP selects [Formula: see text] > 0 top-scoring pairs to build an ensemble classifier. Experimental results show that KF-[Formula: see text]-TSP with multiple kernel functions which evaluates feature combinations from multiple views is better than that with only one kernel function. Meanwhile, KF-[Formula: see text]-TSP performs better than TSP family algorithms and the previous methods based on conversion strategy in most cases. It performs similarly to the popular machine learning methods in omics data analysis, but involves fewer feature pairs. In the procedure of physiological and pathological changes, molecular interactions can be both linear and nonlinear. Hence, KF-[Formula: see text]-TSP, which can measure molecular combination from multiple perspectives, can help to mine information closely related to physiological and pathological changes and study disease mechanism.
{"title":"Analyzing omics data by feature combinations based on kernel functions.","authors":"Chao Li, Tianxiang Wang, Xiaohui Lin","doi":"10.1142/S021972002350021X","DOIUrl":"10.1142/S021972002350021X","url":null,"abstract":"<p><p>Defining meaningful feature (molecule) combinations can enhance the study of disease diagnosis and prognosis. However, feature combinations are complex and various in biosystems, and the existing methods examine the feature cooperation in a single, fixed pattern for all feature pairs, such as linear combination. To identify the appropriate combination between two features and evaluate feature combination more comprehensively, this paper adopts kernel functions to study feature relationships and proposes a new omics data analysis method KF-[Formula: see text]-TSP. Besides linear combination, KF-[Formula: see text]-TSP also explores the nonlinear combination of features, and allows hybridizing multiple kernel functions to evaluate feature interaction from multiple views. KF-[Formula: see text]-TSP selects [Formula: see text] > 0 top-scoring pairs to build an ensemble classifier. Experimental results show that KF-[Formula: see text]-TSP with multiple kernel functions which evaluates feature combinations from multiple views is better than that with only one kernel function. Meanwhile, KF-[Formula: see text]-TSP performs better than TSP family algorithms and the previous methods based on conversion strategy in most cases. It performs similarly to the popular machine learning methods in omics data analysis, but involves fewer feature pairs. In the procedure of physiological and pathological changes, molecular interactions can be both linear and nonlinear. Hence, KF-[Formula: see text]-TSP, which can measure molecular combination from multiple perspectives, can help to mine information closely related to physiological and pathological changes and study disease mechanism.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":"1 1","pages":"2350021"},"PeriodicalIF":1.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41358214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01Epub Date: 2023-09-23DOI: 10.1142/S0219720023400024
Konstantinos Lazaros, Panagiotis Vlamos, Aristidis G Vrahatis
The evolution of single-cell technology is ongoing, continually generating massive amounts of data that reveal many mysteries surrounding intricate diseases. However, their drawbacks continue to constrain us. Among these, annotating cell types in single-cell gene expressions pose a substantial challenge, despite the myriad of tools at our disposal. The rapid growth in data, resources, and tools has consequently brought about significant alterations in this area over the years. In our study, we spotlight all note-worthy cell type annotation techniques developed over the past four years. We provide an overview of the latest trends in this field, showcasing the most advanced methods in taxonomy. Our research underscores the demand for additional tools that incorporate a biological context and also predicts that the rising trend of graph neural network approaches will likely lead this research field in the coming years.
{"title":"Methods for cell-type annotation on scRNA-seq data: A recent overview.","authors":"Konstantinos Lazaros, Panagiotis Vlamos, Aristidis G Vrahatis","doi":"10.1142/S0219720023400024","DOIUrl":"10.1142/S0219720023400024","url":null,"abstract":"<p><p>The evolution of single-cell technology is ongoing, continually generating massive amounts of data that reveal many mysteries surrounding intricate diseases. However, their drawbacks continue to constrain us. Among these, annotating cell types in single-cell gene expressions pose a substantial challenge, despite the myriad of tools at our disposal. The rapid growth in data, resources, and tools has consequently brought about significant alterations in this area over the years. In our study, we spotlight all note-worthy cell type annotation techniques developed over the past four years. We provide an overview of the latest trends in this field, showcasing the most advanced methods in taxonomy. Our research underscores the demand for additional tools that incorporate a biological context and also predicts that the rising trend of graph neural network approaches will likely lead this research field in the coming years.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":" ","pages":"2340002"},"PeriodicalIF":1.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41155989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01Epub Date: 2023-10-28DOI: 10.1142/S0219720023500221
Jiasheng He, Shun Zhang, Chun Fang
The polyproline-II (PPII) structure domain is crucial in organisms' signal transduction, transcription, cell metabolism, and immune response. It is also a critical structural domain for specific vital disease-associated proteins. Recognizing PPII is essential for understanding protein structure and function. To accurately predict PPII in proteins, we propose a novel method, AAindex-PPII, which only adopts amino acid index to characterize protein sequences and uses a Bidirectional Gated Recurrent Unit (BiGRU)-Improved TextCNN composite deep learning model to predict PPII in proteins. Experimental results show that, when tested on the same datasets, our method outperforms the state-of-the-art BERT-PPII method, achieving an AUC value of 0.845 on the strict data and an AUC value of 0.813 on the non-strict data, which is 0.024 and 0.03 higher than that of the BERT-PPII method. This study demonstrates that our proposed method is simple and efficient for PPII prediction without using pre-trained large models or complex features such as position-specific scoring matrices.
{"title":"AAindex-PPII: Predicting polyproline type II helix structure based on amino acid indexes with an improved BiGRU-TextCNN model.","authors":"Jiasheng He, Shun Zhang, Chun Fang","doi":"10.1142/S0219720023500221","DOIUrl":"10.1142/S0219720023500221","url":null,"abstract":"<p><p>The polyproline-II (PPII) structure domain is crucial in organisms' signal transduction, transcription, cell metabolism, and immune response. It is also a critical structural domain for specific vital disease-associated proteins. Recognizing PPII is essential for understanding protein structure and function. To accurately predict PPII in proteins, we propose a novel method, AAindex-PPII, which only adopts amino acid index to characterize protein sequences and uses a Bidirectional Gated Recurrent Unit (BiGRU)-Improved TextCNN composite deep learning model to predict PPII in proteins. Experimental results show that, when tested on the same datasets, our method outperforms the state-of-the-art BERT-PPII method, achieving an AUC value of 0.845 on the strict data and an AUC value of 0.813 on the non-strict data, which is 0.024 and 0.03 higher than that of the BERT-PPII method. This study demonstrates that our proposed method is simple and efficient for PPII prediction without using pre-trained large models or complex features such as position-specific scoring matrices.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":" ","pages":"2350022"},"PeriodicalIF":1.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71414895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01Epub Date: 2023-10-27DOI: 10.1142/S0219720023500233
Zizheng Yu, Zhijian Yin, Hongliang Zou
Various diseases, including Huntington's disease, Alzheimer's disease, and Parkinson's disease, have been reported to be linked to amyloid. Therefore, it is crucial to distinguish amyloid from non-amyloid proteins or peptides. While experimental approaches are typically preferred, they are costly and time-consuming. In this study, we have developed a machine learning framework called iAMY-RECMFF to discriminate amyloidgenic from non-amyloidgenic peptides. In our model, we first encoded the peptide sequences using the residue pairwise energy content matrix. We then utilized Pearson's correlation coefficient and distance correlation to extract useful information from this matrix. Additionally, we employed an improved similarity network fusion algorithm to integrate features from different perspectives. The Fisher approach was adopted to select the optimal feature subset. Finally, the selected features were inputted into a support vector machine for identifying amyloidgenic peptides. Experimental results demonstrate that our proposed method significantly improves the identification of amyloidgenic peptides compared to existing predictors. This suggests that our method may serve as a powerful tool in identifying amyloidgenic peptides. To facilitate academic use, the dataset and codes used in the current study are accessible at https://figshare.com/articles/online_resource/iAMY-RECMFF/22816916.
{"title":"iAMY-RECMFF: Identifying amyloidgenic peptides by using residue pairwise energy content matrix and features fusion algorithm.","authors":"Zizheng Yu, Zhijian Yin, Hongliang Zou","doi":"10.1142/S0219720023500233","DOIUrl":"10.1142/S0219720023500233","url":null,"abstract":"<p><p>Various diseases, including Huntington's disease, Alzheimer's disease, and Parkinson's disease, have been reported to be linked to amyloid. Therefore, it is crucial to distinguish amyloid from non-amyloid proteins or peptides. While experimental approaches are typically preferred, they are costly and time-consuming. In this study, we have developed a machine learning framework called iAMY-RECMFF to discriminate amyloidgenic from non-amyloidgenic peptides. In our model, we first encoded the peptide sequences using the residue pairwise energy content matrix. We then utilized Pearson's correlation coefficient and distance correlation to extract useful information from this matrix. Additionally, we employed an improved similarity network fusion algorithm to integrate features from different perspectives. The Fisher approach was adopted to select the optimal feature subset. Finally, the selected features were inputted into a support vector machine for identifying amyloidgenic peptides. Experimental results demonstrate that our proposed method significantly improves the identification of amyloidgenic peptides compared to existing predictors. This suggests that our method may serve as a powerful tool in identifying amyloidgenic peptides. To facilitate academic use, the dataset and codes used in the current study are accessible at https://figshare.com/articles/online_resource/iAMY-RECMFF/22816916.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":" ","pages":"2350023"},"PeriodicalIF":1.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71414897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01Epub Date: 2023-10-28DOI: 10.1142/S0219720023500245
Ying Zeng, Zheming Yuan, Yuan Chen, Ying Hu
O-glycosylation (Oglyc) plays an important role in various biological processes. The key to understanding the mechanisms of Oglyc is identifying the corresponding glycosylation sites. Two critical steps, feature selection and classifier design, greatly affect the accuracy of computational methods for predicting Oglyc sites. Based on an efficient feature selection algorithm and a classifier capable of handling imbalanced datasets, a new computational method, ChiMIC-based balanced decision table O-glycosylation (CBDT-Oglyc), is proposed. ChiMIC-based balanced decision table for O-glycosylation (CBDT-Oglyc), is proposed to predict Oglyc sites in proteins. Sequence characterization is performed by combining amino acid composition (AAC), undirected composition of [Formula: see text]-spaced amino acid pairs (undirected-CKSAAP) and pseudo-position-specific scoring matrix (PsePSSM). Chi-MIC-share algorithm is used for feature selection, which simplifies the model and improves predictive accuracy. For imbalanced classification, a backtracking method based on local chi-square test is designed, and then cost-sensitive learning is incorporated to construct a novel classifier named ChiMIC-based balanced decision table (CBDT). Based on a 1:49 (positives:negatives) training set, the CBDT classifier achieves significantly better prediction performance than traditional classifiers. Moreover, the independent test results on separate human and mouse glycoproteins show that CBDT-Oglyc outperforms previous methods in global accuracy. CBDT-Oglyc shows great promise in predicting Oglyc sites and is expected to facilitate further experimental studies on protein glycosylation.
{"title":"CBDT-Oglyc: Prediction of O-glycosylation sites using ChiMIC-based balanced decision table and feature selection.","authors":"Ying Zeng, Zheming Yuan, Yuan Chen, Ying Hu","doi":"10.1142/S0219720023500245","DOIUrl":"10.1142/S0219720023500245","url":null,"abstract":"<p><p>O-glycosylation (Oglyc) plays an important role in various biological processes. The key to understanding the mechanisms of Oglyc is identifying the corresponding glycosylation sites. Two critical steps, feature selection and classifier design, greatly affect the accuracy of computational methods for predicting Oglyc sites. Based on an efficient feature selection algorithm and a classifier capable of handling imbalanced datasets, a new computational method, ChiMIC-based balanced decision table O-glycosylation (CBDT-Oglyc), is proposed. ChiMIC-based balanced decision table for O-glycosylation (CBDT-Oglyc), is proposed to predict Oglyc sites in proteins. Sequence characterization is performed by combining amino acid composition (AAC), undirected composition of [Formula: see text]-spaced amino acid pairs (undirected-CKSAAP) and pseudo-position-specific scoring matrix (PsePSSM). Chi-MIC-share algorithm is used for feature selection, which simplifies the model and improves predictive accuracy. For imbalanced classification, a backtracking method based on local chi-square test is designed, and then cost-sensitive learning is incorporated to construct a novel classifier named ChiMIC-based balanced decision table (CBDT). Based on a 1:49 (positives:negatives) training set, the CBDT classifier achieves significantly better prediction performance than traditional classifiers. Moreover, the independent test results on separate human and mouse glycoproteins show that CBDT-Oglyc outperforms previous methods in global accuracy. CBDT-Oglyc shows great promise in predicting Oglyc sites and is expected to facilitate further experimental studies on protein glycosylation.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":" ","pages":"2350024"},"PeriodicalIF":1.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71414896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-08-01Epub Date: 2023-08-24DOI: 10.1142/S0219720023500178
Hayat Ali Shah, Juan Liu, Zhihui Yang, Feng Yang, Qiang Zhang, Jing Feng
Metabolic pathways play a crucial role in understanding the biochemistry of organisms. In metabolic pathways, modules refer to clusters of interconnected reactions or sub-networks representing specific functional units or biological processes within the overall pathway. In pathway modules, compounds are major elements and refer to the various molecules that participate in the biochemical reactions within the pathway modules. These molecules can include substrates, intermediates and final products. Determining the presence relation of compounds and pathway modules is essential for synthesizing new molecules and predicting hidden reactions. To date, several computational methods have been proposed to address this problem. However, all methods only predict the metabolic pathways and their types, not the pathway modules. To address this issue, we proposed a novel deep learning model, DeepRT that integrates message passing neural networks (MPNNs) and transformer encoder. This combination allows DeepRT to effectively extract global and local structure information from the molecular graph. The model is designed to perform two tasks: first, determining the present relation of the compound with the pathway module, and second, predicting the relation of query compound and module classes. The proposed DeepRT model evaluated on a dataset comprising compounds and pathway modules, and it outperforms existing approaches.
{"title":"DeepRT: Predicting compounds presence in pathway modules and classifying into module classes using deep neural networks based on molecular properties.","authors":"Hayat Ali Shah, Juan Liu, Zhihui Yang, Feng Yang, Qiang Zhang, Jing Feng","doi":"10.1142/S0219720023500178","DOIUrl":"10.1142/S0219720023500178","url":null,"abstract":"<p><p>Metabolic pathways play a crucial role in understanding the biochemistry of organisms. In metabolic pathways, modules refer to clusters of interconnected reactions or sub-networks representing specific functional units or biological processes within the overall pathway. In pathway modules, compounds are major elements and refer to the various molecules that participate in the biochemical reactions within the pathway modules. These molecules can include substrates, intermediates and final products. Determining the presence relation of compounds and pathway modules is essential for synthesizing new molecules and predicting hidden reactions. To date, several computational methods have been proposed to address this problem. However, all methods only predict the metabolic pathways and their types, not the pathway modules. To address this issue, we proposed a novel deep learning model, DeepRT that integrates message passing neural networks (MPNNs) and transformer encoder. This combination allows DeepRT to effectively extract global and local structure information from the molecular graph. The model is designed to perform two tasks: first, determining the present relation of the compound with the pathway module, and second, predicting the relation of query compound and module classes. The proposed DeepRT model evaluated on a dataset comprising compounds and pathway modules, and it outperforms existing approaches.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":"21 4","pages":"2350017"},"PeriodicalIF":1.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10306371","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-08-01Epub Date: 2023-09-08DOI: 10.1142/S0219720023500208
Fuyan Hu, Bifeng Chen, Qing Wang, Zhiyuan Yang, Man Chu
Cancer is characterized by the dysregulation of alternative splicing (AS). However, the comprehensive regulatory mechanisms of AS in lung adenocarcinoma (LUAD) are poorly understood. Here, we displayed the AS landscape in LUAD based on the integrated analyses of LUAD's multi-omics data. We identified 13,995 AS events in 6309 genes as differentially expressed alternative splicing events (DEASEs) mainly covering protein-coding genes. These DEASEs were strongly linked to "cancer hallmarks", such as apoptosis, DNA repair, cell cycle, cell proliferation, angiogenesis, immune response, generation of precursor metabolites and energy, p53 signaling pathway and PI3K-AKT signaling pathway. We further built a regulatory network connecting splicing factors (SFs) and DEASEs. In addition, RNA-binding protein (RBP) mutations that can affect DEASEs were investigated to find some potential cancer drivers. Further association analysis demonstrated that DNA methylation levels were highly correlated with DEASEs. In summary, our results can bring new insight into understanding the mechanism of AS and provide novel biomarkers for personalized medicine of LUAD.
{"title":"Multi-omics data analysis reveals the biological implications of alternative splicing events in lung adenocarcinoma.","authors":"Fuyan Hu, Bifeng Chen, Qing Wang, Zhiyuan Yang, Man Chu","doi":"10.1142/S0219720023500208","DOIUrl":"10.1142/S0219720023500208","url":null,"abstract":"<p><p>Cancer is characterized by the dysregulation of alternative splicing (AS). However, the comprehensive regulatory mechanisms of AS in lung adenocarcinoma (LUAD) are poorly understood. Here, we displayed the AS landscape in LUAD based on the integrated analyses of LUAD's multi-omics data. We identified 13,995 AS events in 6309 genes as differentially expressed alternative splicing events (DEASEs) mainly covering protein-coding genes. These DEASEs were strongly linked to \"cancer hallmarks\", such as apoptosis, DNA repair, cell cycle, cell proliferation, angiogenesis, immune response, generation of precursor metabolites and energy, p53 signaling pathway and PI3K-AKT signaling pathway. We further built a regulatory network connecting splicing factors (SFs) and DEASEs. In addition, RNA-binding protein (RBP) mutations that can affect DEASEs were investigated to find some potential cancer drivers. Further association analysis demonstrated that DNA methylation levels were highly correlated with DEASEs. In summary, our results can bring new insight into understanding the mechanism of AS and provide novel biomarkers for personalized medicine of LUAD.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":"21 4","pages":"2350020"},"PeriodicalIF":1.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10307695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-08-01Epub Date: 2023-09-08DOI: 10.1142/S0219720023500191
Carlos E M Relvas, Asuka Nakata, Guoan Chen, David G Beer, Noriko Gotoh, Andre Fujita
Usually, the clustering process is the first step in several data analyses. Clustering allows identify patterns we did not note before and helps raise new hypotheses. However, one challenge when analyzing empirical data is the presence of covariates, which may mask the obtained clustering structure. For example, suppose we are interested in clustering a set of individuals into controls and cancer patients. A clustering algorithm could group subjects into young and elderly in this case. It may happen because the age at diagnosis is associated with cancer. Thus, we developed CEM-Co, a model-based clustering algorithm that removes/minimizes undesirable covariates' effects during the clustering process. We applied CEM-Co on a gene expression dataset composed of 129 stage I non-small cell lung cancer patients. As a result, we identified a subgroup with a poorer prognosis, while standard clustering algorithms failed.
{"title":"A model-based clustering algorithm with covariates adjustment and its application to lung cancer stratification.","authors":"Carlos E M Relvas, Asuka Nakata, Guoan Chen, David G Beer, Noriko Gotoh, Andre Fujita","doi":"10.1142/S0219720023500191","DOIUrl":"10.1142/S0219720023500191","url":null,"abstract":"Usually, the clustering process is the first step in several data analyses. Clustering allows identify patterns we did not note before and helps raise new hypotheses. However, one challenge when analyzing empirical data is the presence of covariates, which may mask the obtained clustering structure. For example, suppose we are interested in clustering a set of individuals into controls and cancer patients. A clustering algorithm could group subjects into young and elderly in this case. It may happen because the age at diagnosis is associated with cancer. Thus, we developed CEM-Co, a model-based clustering algorithm that removes/minimizes undesirable covariates' effects during the clustering process. We applied CEM-Co on a gene expression dataset composed of 129 stage I non-small cell lung cancer patients. As a result, we identified a subgroup with a poorer prognosis, while standard clustering algorithms failed.","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":"21 4","pages":"2350019"},"PeriodicalIF":1.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10307699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}