Should I replace heterozygous variants to make a consensus
0
0
Entering edit mode
6.1 years ago
deepti1rao ▴ 50

I want to make a consensus genome by replacing variants. I want to replace homozygous variants in the reference. Is it right to replace the heterozygous variants? The ALT allele must correspond to the homozygous chromosome of a diploid organism. That's my understanding. So I am thinking of not replacing such variants.

Variant Consensus Genome assembly Heterozygous • 1.6k views
ADD COMMENT
0
Entering edit mode

What is your goal in generating a consensus genome ?

ADD REPLY
0
Entering edit mode

Hi! The goal is to do a reference based assembly. 97% of our reads align to the reference.

ADD REPLY
0
Entering edit mode

So why didn't you use a reference-guided genome assembly (e.g. Velvet, MIRA, Spades, etc..) ?

ADD REPLY
0
Entering edit mode

Currently, I do not have enough data to take up a proper assembly. I have tried velvet de novo. When I mapped the resulting contigs to the reference, I found a lot of misassemblies and the coverage is far less than what my reads cover.

I think all the reference based assemblers initially do a de novo assembly and then map the contigs to the reference. So it must be the same method that I've used. I have only paired end data. No mate pairs. Even the paired end data is pooled from different plants, making it 120 x. I am not sure if this kind of a raw data is good enough for a de novo assembly. Since the reference is so close, I rather want to map reads to it directly and replace the variants in it.

ADD REPLY
0
Entering edit mode

if you want to save information about heterozygosity, you can use IUPAC codes to represent diploid state.

ADD REPLY
0
Entering edit mode

Thanks for this idea! Are two base codes understood and accepted by tools like Bowtie2, samtools etc for future analyses??

ADD REPLY

Login before adding your answer.

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