PubMed İndeksli Yayınlar Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12573/397
Browse
2 results
Search Results
Article Predicting Respiratory Infection and Symptoms Development Using Gene Set Enrichment Scores and Machine Learning(Elsevier Sci Ltd, 2026) Aydin, Zafer; Isik, Yunus EmreRecent advancements in precision medicine enable personalized predictions grounded in individual-level genetic data. However, relying solely on a single type of data can decrease prediction accuracy and limit the biological interpretability of the resulting models. Incorporating predefined genetic knowledge, such as derived gene sets, can improve performance and provide deeper biological insights for complex diseases, including respiratory infections. This study aimed to evaluate the usability of enrichment scores (ES), calculated using gene sets from the Molecular Signatures Database (MSigDB), as a feature representation for machine learning models to predict respiratory viral infections and symptom development. In addition, the proposed feature representation approach was extensively compared with the de facto gene-level expression representation. A total of 36,834 predefined gene sets were compiled from the MSigDB, and their ES values were calculated. Experiments used the GSE73072 dataset from Gene Expression Omnibus, containing gene expression profiles before and after virus exposure. Various machine learning and feature selection algorithms were applied to ES-based and probe-level feature sets. The results showed that both feature representation approaches achieved an area under the precision-recall curve (AUPRC) value greater than 0.90 for all tasks. Compared with the Respiratory Viral DREAM Challenge leaderboard phase, our models showed a 14.8% improvement in pre-exposure predictions (T0) and a 17.4% improvement in symptom classification. Using enrichment scores as a feature representation generally resulted in better performance than probe-level representation when predicting respiratory infections and symptom development. Identifying key gene sets through feature selection and comparing them with essential genes for respiratory viruses enabled a more comprehensive analysis, providing deeper insights into the pathways that contribute to these predictions.Article Citation - WoS: 7Citation - Scopus: 11Protein Β-Sheet Prediction Using an Efficient Dynamic Programming Algorithm(Elsevier Sci Ltd, 2017-10) Sabzekar, Mostafa; Naghibzadeh, Mahmoud; Eghdami, Mandie; Aydin, ZaferPredicting the beta-sheet structure of a protein is one of the most important intermediate steps towards the identification of its tertiary structure. However, it is regarded as the primary bottleneck due to the presence of non-local interactions between several discontinuous regions in beta-sheets. To achieve reliable long-range interactions, a promising approach is to enumerate and rank all beta-sheet conformations for a given protein and find the one with the highest score. The problem with this solution is that the search space of the problem grows exponentially with respect to the number of beta-strands. Additionally, brute force calculation in this conformational space leads to dealing with a combinatorial explosion problem with intractable computational complexity. The main contribution of this paper is to generate and search the space of the problem efficiently to reduce the time complexity of the problem. To achieve this, two tree structures, called sheet-tree and grouping-tree, are proposed. They model the search space by breaking it into sub-problems. Then, an advanced dynamic programming is proposed that stores the intermediate results, avoids repetitive calculation by repeatedly uses them efficiently in successive steps and reduces the space of the problem by removing those intermediate results that will no longer be required in later steps. As a consequence, the following contributions have been made. Firstly, more accurate beta-sheet structures are found by searching all possible conformations, and secondly, the time complexity of the problem is reduced by searching the space of the problem efficiently which makes the proposed method applicable to predict beta-sheet structures with high number of beta-strands. Experimental results on the BetaSheet916 dataset showed significant improvements of the proposed method in both execution time and the prediction accuracy in comparison with the state-of-the-art beta-sheet structure prediction methods Moreover, we investigate the effect of different contact map predictors on the performance of the proposed method using BetaSheet1452 dataset. The source code is available at http://www.conceptsgate.com/BetaTop.rar. (C) 2017 Elsevier Ltd. All rights reserved.