Mehmet Baysan

Dr. Mehmet Baysan

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 July 2017 in International Journal of Cancer
Verified
Journal Article
Closed access
PDF file
MBMehmet Baysan
Mehmet Baysan
KWKevin Woolard
Kevin Woolard
MCMargaret C. Cam
Margaret C. Cam
WZWei Zhang
Wei Zhang
HSHua Song
Hua Song
HFHoward A. Fine
Howard A. Fine

12 September 2008 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
MBMehmet Baysan
Mehmet Baysan
KSKamil Sarac
Kamil Sarac
RCRamaswamy Chandrasekaran
Ramaswamy Chandrasekaran
SBSergey Bereg
Sergey Bereg
Network-wide broadcast (simply broadcast) is a frequently used operation in wireless ad hoc networks (WANETs). One promising practical approach for energy-efficient broadcast is to use localized algorithms to minimize the number of nodes involved in the propagation of the broadcast messages. In this context, the minimum forwarding set problem (MFSP) (also known as multipoint relay (MPR) problem) has received a considerable attention in the research community. Even though the general form of the problem is shown to be NP-complete, the complexity of the problem has not been known under the practical application context of ad hoc networks. In this paper, we present a polynomial time algorithm to solve the MFSP for wireless network under unit disk coverage model. We prove the existence of some geometrical properties for the problem and then propose a polynomial time algorithm to build an optimal solution based on these properties. To the best of our knowledge, our algorithm is the first polynomial time solution to the MFSP under the unit disk coverage model. We believe that the work presented in this paper will have an impact on the design and development of new algorithms for several wireless network applications including energy-efficient multicast, broadcast, and topology control protocols for WANETs and sensor networks.

1 November 2024 in Stresses
Verified
Journal Article
Open access
PDF file
AÖAbdulkadir Özel
Abdulkadir Özel
Alican TopalogluAlican Topaloglu
Alican Topaloglu
ÖEÖmer Esen
Ömer Esen
CHCan Holyavkin
Can Holyavkin
MBMehmet Baysan
Mehmet Baysan
ZCZ. Petek Cakar
Z. Petek Cakar
Meta-analysis is a beneficial approach to reevaluating the outcomes of independent previous studies in the same scope. Saccharomyces cerevisiae, or the baker’s yeast, is a commonly used unicellular and eukaryotic model organism. In this study, 12 evolved S. cerevisiae strains that became resistant to diverse stress conditions (boron, caffeine, caloric restriction, cobalt, coniferyl aldehyde, ethanol, iron, nickel, oxidative stress, 2-phenylethanol, and silver stress) by adaptive laboratory evolution were reassessed to reveal the correlated stress/stressor clusters based on their transcriptomic and stress–cross-resistance data. Principal Component Analysis (PCA) with k-means clustering was performed. Five clusters for the transcriptomic data of strains and six clusters for cross-resistance stressors were identified. Through statistical evaluations, critical genes pertinent to each cluster were elucidated. The pathways associated with these genes were investigated using the KEGG database. The findings demonstrated that caffeine and coniferyl aldehyde stressors exhibit clear distinctions from other stressors in terms of both physiological stress-cross-resistance responses and transcriptomic profiles. Pathway analysis showed that ribosome biogenesis was downregulated, and starch and sucrose metabolism was upregulated across all clusters. Gene and pathway analyses have shown that stressors lead to distinct changes in yeast gene expression, and these alterations have been systematically documented for each cluster. Several of the highlighted genes are pivotal for further exploration and could potentially clarify new aspects of stress response mechanisms and multiple stress resistance in yeast.

26 March 2024 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MEMehmet Arif Ergun
Mehmet Arif Ergun
OCOmer Cinal
Omer Cinal
BBBerkant Bakışlı
Berkant Bakışlı
AEAbdullah Asım Emül
Abdullah Asım Emül
MBMehmet Baysan
Mehmet Baysan
Background: Recent improvements in sequencing technologies enabled detailed profiling of genomic features. These technologies mostly rely on short reads which are merged and compared to reference genome for variant identification. These operations should be done with computers due to the size and complexity of the data. The need for analysis software resulted in many programs for mapping, variant calling and annotation steps. Currently, most programs are either expensive enterprise software with proprietary code which makes access and verification very difficult or open-access programs that are mostly based on command-line operations without user interfaces and extensive documentation. Moreover, a high level of disagreement is observed among popular mapping and variant calling algorithms in multiple studies, which makes relying on a single algorithm unreliable. User-friendly open-source software tools that offer comparative analysis are an important need considering the growth of sequencing technologies. Results: Here, we propose Comparative Sequencing Analysis Platform (COSAP), an open-source platform that provides popular sequencing algorithms for SNV, indel, structural variant calling, copy number variation, microsatellite instability and fusion analysis and their annotations. COSAP is packed with a fully functional user-friendly web interface and a backend server which allows full independent deployment for both individual and institutional scales. COSAP is developed as a workflow management system and designed to enhance cooperation among scientists with different backgrounds. It is publicly available at https://cosap.bio and https://github.com/MBaysanLab/cosap/. The source code of the frontend and backend services can be found at https://github.com/MBaysanLab/cosap-webapi/ and https://github.com/MBaysanLab/cosap_frontend/ respectively. All services are packed as Docker containers as well. Pipelines that combine algorithms can be customized and new algorithms can be added with minimal coding through modular structure. Conclusions: COSAP simplifies and speeds up the process of DNA sequencing analyses providing commonly used algorithms for SNV, indel, structural variant calling, copy number variation, microsatellite instability and fusion analysis as well as their annotations. COSAP is packed with a fully functional user-friendly web interface and a backend server which allows full independent deployment for both individual and institutional scales. Standardized implementations of popular algorithms in a modular platform make comparisons much easier to assess the impact of alternative pipelines which is crucial in establishing reproducibility of sequencing analyses.

3 September 2024 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
AEAbdullah Asım Emül
Abdullah Asım Emül
MEMehmet Arif Ergün
Mehmet Arif Ergün
RERumeysa Aslıhan Ertürk
Rumeysa Aslıhan Ertürk
ÖÇÖmer Çinal
Ömer Çinal
MBMehmet Baysan
Mehmet Baysan
Background: Advancements over the past decade in DNA sequencing technology and computing power have created the potential to revolutionize medicine. There has been a marked increase in genetic data available, allowing for the advancement of areas such as personalized medicine. A crucial type of data in this context is genetic variant data which is stored in variant call format (VCF) files. However, the rapid growth in genomics has presented challenges in analyzing and comparing VCF files. Results: In response to the limitations of existing tools, this paper introduces a novel web application that provides a user-friendly solution for VCF file analyses and comparisons. The software tool enables researchers and clinicians to perform high-level analysis with ease and enhances productivity. The application’s interface allows users to conveniently upload, analyze, and visualize their VCF files using simple drag-and-drop and point-and-click operations. Essential visualizations such as Venn diagrams, clustergrams, and precision–recall plots are provided to users. A key feature of the application is its support for metadata-based file grouping, accomplished through flexible data matrix uploads, streamlining organization and analysis of user-defined categories. Additionally, the application facilitates standardized benchmarking of VCF files by integrating user-provided ground truth regions and variant lists. Conclusions: By providing a user-friendly interface and supporting essential visualizations, this software enhances the accessibility of VCF file analysis and assists researchers and clinicians in their scientific inquiries.

22 March 2024 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
YCYunus Emre Cebeci
Yunus Emre Cebeci
RERumeysa Aslihan Erturk
Rumeysa Aslihan Erturk
MEMehmet Arif Ergun
Mehmet Arif Ergun
MBMehmet Baysan
Mehmet Baysan
Next-generation sequencing (NGS) technologies offer fast and inexpensive identification of DNA sequences. Somatic sequencing is among the primary applications of NGS, where acquired (non-inherited) variants are based on comparing diseased and healthy tissues from the same individual. Somatic mutations in genetic diseases such as cancer are tightly associated with genomic instability. Genomic instability increases heterogenity, complicating sequencing efforts further, a task already challenged by the presence of short reads and repetitions in human DNA. This leads to low concordance among studies and limits reproducibility. This limitation is a significant problem since identified mutations in somatic sequencing are major biomarkers for diagnosis and the primary input of targeted therapies. Benchmarking studies were conducted to assess the error rates and increase reproducibility. Unfortunately, the number of somatic benchmarking sets is very limited due to difficulties in validating true somatic variants. Moreover, most NGS benchmarking studies are based on relatively simpler germline (inherited) sequencing. Recently, a comprehensive somatic sequencing benchmarking set was published by Sequencing Quality Control Phase 2 (SEQC2). We chose this dataset for our experiments because it is a well-validated, cancer-focused dataset that includes many tumor/normal biological replicates. Our study has two primary goals. First goal is to determine how replicate-based consensus approaches can improve the accuracy of somatic variant detection systems. Second goal is to develop highly predictive machine learning (ML) models by employing replicate-based consensus variants as labels during the training phase. Ensemble approaches that combine alternative algorithms are relatively common; here, as an alternative, we study the performance enhancement potential of biological replicates. We first developed replicate-based consensus approaches that utilize the biological replicates available in this study to improve variant calling performance. Subsequently, we trained ML models using these biological replicates and achieved performance comparable to optimal ML models, those trained using high-confidence variants identified in advance. Our replicate-based consensus approach can be used to improve variant calling performance and develop efficient ML models. Given the relative ease of obtaining biological replicates, this strategy allows for the development of efficient ML models tailored to specific datasets or scenarios.