Please use this identifier to cite or link to this item:
http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9026
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Garg, Pardeep | - |
dc.contributor.author | Sharma, Sunildatt | - |
dc.date.accessioned | 2023-01-09T05:38:12Z | - |
dc.date.available | 2023-01-09T05:38:12Z | - |
dc.date.issued | 2020 | - |
dc.identifier.uri | http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9026 | - |
dc.description.abstract | In the era of big data analysis, genomics data analysis is highly needed to extract the hidden information present in the DNA sequences. One of the important hidden features present in the DNA sequences is CpG islands. CpG Islands are important as these are used as gene markers and also these are associated with cancer etc. Therefore, various methods have been reported for the identification of CpG islands in DNA sequences. The key contributions of this work are (i) extraction of the periodicity feature associated with CpG islands using Short-time Fourier transform (ii) a short-time Fourier transform-based algorithm has been proposed for the identification of CpG Islands in DNA sequences. The results of the proposed algorithm amply demonstrate its better performance as compared to other reported methods on CpG islands detection. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Jaypee University of Information Technology, Solan, H.P. | en_US |
dc.subject | CpG islands | en_US |
dc.subject | DNA sequences | en_US |
dc.subject | Numerical mapping | en_US |
dc.subject | Short-time fourier transform | en_US |
dc.title | Identification of CpG Islands in DNA Sequences Using Short‑Time Fourier Transform | en_US |
dc.type | Article | en_US |
Appears in Collections: | Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Identification of CpG Islands in DNA Sequences Using Short-Time Fourier Transform.pdf | 1.67 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.