DMRIntTk: integrating different DMR sets based on density peak clustering
\textbf{Background}: Identifying differentially methylated regions (DMRs) is a basic task in DNA methylation analysis. However, due to the different strategies adopted, different DMR sets will be predicted on the same dataset, which poses a challenge in selecting a reliable and comprehensive DMR set for downstream analysis. \textbf{Results}: Here, we develop DMRIntTk, a toolkit for integrating DMR sets predicted by different methods on a same dataset. In DMRIntTk, the genome is segmented into bins and the reliability of each DMR set at different methylation thresholds is evaluated. Then, the bins are weighted based on the covered DMR sets and integrated into DMRs by using a density peak clustering algorithm. To demonstrate the practicality of DMRIntTk, DMRIntTk was applied to different scenarios, including different tissues with relatively large methylation differences, cancer tissues versus normal tissues with medium methylation differences, and disease tissues versus normal tissues with subtle methylation differences. The results show that DMRIntTk can effectively trim the regions with small methylation differences in the original DMR sets and therefore it can enhance the proportion of DMRs with higher methylation differences. In addition, the overlap analysis suggests that the integrated DMR sets are quite comprehensive, and the functional analysis indicates the integrated disease-related DMR sets are significantly enriched in biological pathways, which are associated with the pathological mechanisms of the diseases. \textbf{Conclusions}: Conclusively, DMRIntTk can help researchers obtaining a reliable and comprehensive DMR set from many prediction methods. \textbf{Keywords}:{Differentially methylated regions, Methylation array, Cancer-related differentially methylated regions, Tissue-specific differentially methylated regions, Density peak clustering.}
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
VDPC: Variational Density Peak Clustering Algorithm
The widely applied density peak clustering (DPC) algorithm makes an intuitive cluster formation assumption that cluster centers are often surrounded by data points with lower local density and far away from other data po…
ClusteringLGBQPC: Local Granular-Ball Quality Peaks Clustering
The density peaks clustering (DPC) algorithm has attracted considerable attention for its ability to detect arbitrarily shaped clusters based on a simple yet effective assumption. Recent advancements integrating granular…
ClusteringComputational EfficiencyDensity EstimationAutomatic topography of high-dimensional data sets by non-parametric Density Peak clustering
Data analysis in high-dimensional spaces aims at obtaining a synthetic description of a data set, revealing its main structure and its salient features. We here introduce an approach providing this description in the for…
ClusteringAn Improved Probability Propagation Algorithm for Density Peak Clustering Based on Natural Nearest Neighborhood
Clustering by fast search and find of density peaks (DPC) (Since, 2014) has been proven to be a promising clustering approach that efficiently discovers the centers of clusters by finding the density peaks. The accuracy …
ClusteringNonparametric ClusteringA density peaks clustering algorithm with sparse search and K-d tree
Density peaks clustering has become a nova of clustering algorithm because of its simplicity and practicality. However, there is one main drawback: it is time-consuming due to its high computational complexity. Herein, a…
2kClustering