Skip to content
naulon
Not checkedNot checked for notices yet.

DNA Methylation Prediction Using Reduced Features Obtained via Gappy Pair Kernel and Partial Least Square

Sajid Shah, Altaf Ur Rahman, Saima Jabeen and 3 more

IEEE Access · 2022

doi:10.1109/access.2022.3174260 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

It is critical to correctly identify DNA methylation because it has been linked to a variety of human disorders, particularly cancer. DNA methylation is an epigenetic process that allows cells to alter gene expression. This work deals with a type of DNA methylation called 5-methyl cytosine (m5c), in which the methyl group (<inline-formula> <tex-math notation="LaTeX">$CH_{3}$ </tex-math></inline-formula>) is attached to the <inline-formula> <tex-math notation="LaTeX">$5^{th}$ </tex-math></inline-formula> carbon of cytosine. The performances of different machine learning algorithms used for methylation identification are greatly degraded due to poor representation of input sequential data. In the current work, we have proposed a classification model that is based on the extraction of high differentiating features from the sample sequences using gappy pair kernel. Increasing the number of features to better represent a sequence leads to the curse of dimensionality, which is handled by a dimensionality reduction technique called PLS (Partial Least Square). The obtained features are then subjected to multiple classifiers to test the discriminating power of these features. Results are computed for cross species i.e human and mouse, to check the robustness of our proposed model. Finally, the obtained results are compared in terms of sensitivity, specificity, and accuracy with the state-of-the-art approaches. Our proposed approach has outperformed state-of-the-art techniques in all three metrics for both datasets. For research community to test our technique, we have uploaded our code on github (<uri>https://github.com/sajidshahbs/gappypairKernel_Rcode</uri>).

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.