Variant calling within and between 2 nematode strains
1
0
Entering edit mode
8.2 years ago
standonn ▴ 20

Dear all,

I have the genome sequence of a nematode species I'm working with. This genome was assembled using reads (3 pair-end libraries and 2 mate-pair) from one particular strain (let's call it Strain A).

Now I have one pair-end library for another strain (Strain B).

I would like to call SNPs and InDels within and between strains. I am unsure about how to do this.

I thought about using one of the following pipelines (or a similar one): https://approachedinthelimit.wordpress.com/2015/10/09/variant-calling-with-gatk/ or https://github.com/metalhelix/pipette

Basically, I would align my reads against the genome, mark the duplicates, run the UnifiedGenotyper of GATK and filter the variants.

Now some questions and concerns: - I have a lots more read files for Strain A then Strain B (only one library). Should I only use one library of Strain A? Does the insert size matter? - The pipeline I described above will enable me to get variants within each strain but not between strains. Do you know any way I could do this analysis?

Many thanks for your suggestions and insights! Sophie

SNP reference genome reads • 2.2k views
ADD COMMENT
0
Entering edit mode
8.2 years ago
Medhat 9.8k

you can follow GATK best practice , where you can detect snps between samples but you will follow HaplotypeCaller caller Why do joint calling rather than single-sample calling?
Or FreeBayes

ADD COMMENT
0
Entering edit mode

Thanks a lot for your answer! The links you sent really do help!

ADD REPLY
0
Entering edit mode

I also encourage reading about FreeBayes

  • much faster
  • somewhat better in detecting concordant SNPs and indels
  • worse with False Positives and False Negatives

Good luck :)

ADD REPLY
0
Entering edit mode

Please accept the answer so that other readers of the forum will benefit.

ADD REPLY

Login before adding your answer.

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