Mapping paired end and single end reads together
1
1
Entering edit mode
9.9 years ago
GR ▴ 400

Hi Everyone,

I have my raw data as two paired end reads file (one for left and one for right reads) plus a file where I have only single end reads. I am wondering if it is possible to align all this data to the reference genome?

Thanks.

mapping • 6.6k views
ADD COMMENT
0
Entering edit mode

Yes, it is possible. Which kind of data do you have? RNASeq or DNA?

ADD REPLY
0
Entering edit mode

Whether this is possible in a single command is completely dependent on the aligner you're using.

ADD REPLY
0
Entering edit mode

I have DNA seq data and I want to use bwa.

ADD REPLY
0
Entering edit mode

I was thinking of doing the same thing but won't we be duplicating reads, as we will be counting the same read twice - once from paired end fastq and once from the single read fastq???

ADD REPLY
0
Entering edit mode
9.9 years ago
Gabriel R. ★ 2.9k

Is this genomic? Is BWA ok? You could transform the data into BAM and use this: https://github.com/udo-stenzel/network-aware-bwa

It's a custom version of BWA that eats BAM (paired and single reads) and spits out BAM.

ADD COMMENT
3
Entering edit mode

I am wondering if it would be appropriate to do the following: 1) map the paired end and single end read data individually 2) sort the data 3) Merge both the bam files (single end+paired end).

Please suggest!

ADD REPLY
2
Entering edit mode

That's perfectly fine.

ADD REPLY
1
Entering edit mode

I would do this instead:

  1. Merge both the paired and unpaired using samtools cat
  2. Pipe into network-aware-bwa

This gives you a single mapping step and does not require additional files.

ADD REPLY
0
Entering edit mode

Thanks Samuel. I will try this.

ADD REPLY
0
Entering edit mode

You need libzeromq to install the bwa package. You can get it via apt-get install

ADD REPLY

Login before adding your answer.

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