The Community for Technology Leaders
2013 IEEE International Conference on Bioinformatics and Biomedicine (2012)
Philadelphia, PA, USA USA
Oct. 4, 2012 to Oct. 7, 2012
ISBN: 978-1-4673-2559-2
pp: 1-4
Iman Rezaeian , School of Computer Science, University of Windsor, Windsor, Canada
Luis Rueda , School of Computer Science, University of Windsor, Windsor, Canada
ABSTRACT
Finding genomic features in ChlP-Seq data has become an attractive research topic lately, because of the power, resolution and low-noise of next generation sequencing, making it a much better alternative to traditional microarrays such as ChlP-chip and other related methods. However, handling ChlP-Seq data is not straightforward, mainly because of the large amounts of data produced by next generation sequencing. ChlP-Seq has widespread over a range of applications in finding biomarkers, especially those associated with important genomic features in epigenomics and transcriptomics, including binding sites, promoters, exons/introns, transcription sites, among others. Efficient algorithms for finding relevant regions in ChlP-Seq data have been proposed, which capture the most significant peaks from the sequence reads. Among these, multilevel thresholding algorithms have been applied successfully for transcriptomics and genomics data analysis, in particular for detecting significant regions based on next generation sequencing data. We show that the Optimal Multilevel Thresholding algorithm (OMT) achieves higher accuracy in detecting enriched regions and genomic features of detected regions on FoxAl data. OMT finds more gene-related regions (gene, exon, promoter) in comparison with other methods. Using a small number of parameters is another advantage of the proposed method.
INDEX TERMS
ChlP-Seq data analysis, multi level thresholding, transcriptomics
CITATION
Iman Rezaeian, Luis Rueda, "Finding genomic features from enriched regions in ChlP-Seq data", 2013 IEEE International Conference on Bioinformatics and Biomedicine, vol. 00, no. , pp. 1-4, 2012, doi:10.1109/BIBM.2012.6392731
88 ms
(Ver 3.3 (11022016))