Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Esma Cansu Cevik

dblp:439/0168 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 50% Computational science and engineering · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational science and engineering › statistical computing
data imputation
1.012026
slideimp: efficient imputation of DNA methylation data · Bioinform. 2026
Bioinformatics and computational biology › epigenomics › DNA methylation
DNA methylation analysis
1.012026
slideimp: efficient imputation of DNA methylation data · Bioinform. 2026

Methods — techniques the papers use, named apart from their topics

sliding window · 1.0principal component analysis · 1.0k-nearest neighbor · 1.0
YearPublicationVenuePosition
2026 slideimp: efficient imputation of DNA methylation data
abstract
Abstract Motivation There is a growing need for efficient imputation methods for high-dimensional DNA methylation (DNAm) datasets. Existing microarray imputation approaches, such as k-nearest neighbors (K-NN) or principal component analysis (PCA)-based methods, provide high accuracy but can be computationally intensive, while methods for whole-genome data are not designed for large cohorts. We developed slideimp, an R package that implements sliding window, groupable, parallelized K-NN and optimized PCA imputation to address these limitations. Results Benchmarks on microarray DNAm datasets demonstrate that slideimp achieves up to 150x faster runtime and 10x-100x lower memory usage while maintaining comparable or superior accuracy over existing methods and implementations. For K-NN and PCA imputation, slideimp supports grouped imputation which enhances imputation efficiency and accuracy. In a whole-genome dataset, sliding window K-NN imputation substantially increased the correlation of the Horvath 2013 clock with chronological age from 0.131 to 0.477. Additional features include targeted imputation of CpG subsets for K-NN and estimation of imputation accuracy via repeated cross-validation. The efficient and flexible DNAm imputation methods implemented by slideimp can easily be applied to other high-dimensional data types. Availability and Implementation The code to fully reproduce all analyses presented in this paper is available on GitHub at https://github.com/hhp94/slideimp_paper . The R package slideimp is also available on GitHub at https://github.com/hhp94/slideimp . Supplemental figures are available online.
Hung Pham, Adam P. Lombroso, Esma Cansu Cevik, Hugh S. Taylor, Kieran J. O'Donnell
Bioinform.3