Does Bowtie2 Map Multiple Reads To The Same Gene?
2
1
Entering edit mode
12.0 years ago
derekc10741 ▴ 20

Hi all, I'm new to bioinformatics and I've a question about bowtie2. I know that bowtie2 reports read that map to the reference genome, but what if there are multiple reads that map to the same exact same gene? Does bowtie2 support that? I know it looks for the best alignment, and its decision of which alignment to report is random, but if there are 5 reads which all align equally well to a gene in a reference genome, does it's output only have 1 of those reads, or does it have all 5? Thanks

bowtie2 • 4.2k views
ADD COMMENT
0
Entering edit mode

Perhaps you are already aware: however, I thought I'd mention that the aligner (bowtie 2) is not aware of genes.

ADD REPLY
0
Entering edit mode

I think you have it backwards. Did you mean to ask what happens if the same read aligns to multiple locations in the genome?

ADD REPLY
4
Entering edit mode
12.0 years ago

The best alignment for each read is reported independently. You can have many reads mapping to exactly the same genomic coordinates (and indeed often will, especially with particular experiment types) and they will all be reported in the SAM file.

ADD COMMENT
0
Entering edit mode

And then how do you go about deciding which read is the best match if mapQ is also the same for all?

ADD REPLY
0
Entering edit mode
12.0 years ago
Rahul Sharma ▴ 660

Hi,

You can use the read depth viewers(IGV, tablet or IGB) and see the coverage depth of your gene. You need to import the reference genome file, Its gff3 file and SAM file generated by bowtie2. Or one can also try samtools mileup(http://samtools.sourceforge.net/mpileup.shtml) it will generate the read coverage output in tabular form for all genome positions, later unix awk/grep can be used for further analysis.

Regards, Rahul

ADD COMMENT

Login before adding your answer.

Traffic: 831 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