Single-base bins for finding enrichment at promoters
1
0
Entering edit mode
4.3 years ago
sobethon ▴ 10

Using R, how would I be able to create single-base bins from a GenomicRanges object (transcripts/promoters) of the hg19 genome? I have a BAM file with CHIP-seq reads, and I would like to find the read depth at each individual base in the promoters GRanges object, in determining enrichment.

I created an RleViewsList object for my reads and the hg19 promoters. How can I essentially obtain the number of overlaps per promoter at a single-base resolution?

ChIP-Seq alignment genome R sequence • 977 views
ADD COMMENT
0
Entering edit mode
4.3 years ago

Hi! This would be a slightly different approach, but you could take your bam file and convert it to a genomecov file using BedTools. The genomecov file is a three column tsv with the chromosome as the first column, the base pair position as the second column, and the amount of reads covering that base pair in the third column. From here you could simply read the genomecov into R as a tsv, select the region of interest and generate whatever analysis or plot you require.

https://bedtools.readthedocs.io/en/latest/content/tools/genomecov.html

ADD COMMENT
0
Entering edit mode

Thanks! The tsv files for per base whole genome coverage are too large for me though. Is there a way to only return coverage for only select region (eg. all promoters)?

ADD REPLY
0
Entering edit mode

That's understandable. Another option is, as the intermediate file between the bam and the genomecov is a bed file, you could take the bed file and intersect it with your promoter regions. Then take that filtered bed file and run it through the genomecov function. The resulting file should then be much smaller and only have the per base counts of the promoter regions.

https://bedtools.readthedocs.io/en/latest/content/tools/intersect.html

ADD REPLY

Login before adding your answer.

Traffic: 1563 users visited in the last hour
Help About
FAQ
Access RSS
API
Stats

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.

Powered by the version 2.3.6