Scafolding and gap filling
2
0
Entering edit mode
7.2 years ago

Hello all,

for one of the novel fungi, we did illumina mi-seq paired end sequencing and used velvet to assemble, I have 15500 contigs.

some information about reads (after removing adapters and poor quality bases):

Encoding : Sanger / Illumina 1.9

Total Sequences : 1747634

Sequence length : 36-301

If I had extra/additional reads I could have tried scaffolding or gap filling. Is there any option to reduce number of contigs?

Thanks Bhagya C T

Assembly illumina scafolding gap filling • 3.4k views
ADD COMMENT
0
Entering edit mode

Can you please provide some information on the "extra/additional reads" ?

ADD REPLY
0
Entering edit mode
7.2 years ago

I have paired end reads from Mi-seq only, I do not have any other reads. To do scaffolding or gap filling I should have extra reads right?

Whatever the reads I got from Mi-seq paired end sequencing I used for velvet denovo assembly.

ADD COMMENT
0
Entering edit mode
7.2 years ago
Sej Modha 5.3k

For gap filling you can use GapFiller and use reference based scaffolding tool such as Scaffold_builder or reference independent scaffolding tool e.g. SSPACE.

ADD COMMENT
0
Entering edit mode

Thank you.

I do not have any additional reads to use for scaffolding, all I have is illumina Mi-seq paired end data. I still just tried to use SSPACE with denovo assembled genome file and paired end data(same ones, used for denovo assembly). It resulted in exact same number of contigs observed in the denovo assembled file.

It looks like if I do not have any additional reads, I cannot do anything further to improve the assembly?

ADD REPLY
0
Entering edit mode

You can possibly use a "reference based scaffolder" such as medusa, ragout, or other tools. This compares a genome to a closely related one and uses synteny to infer scaffolding

ADD REPLY

Login before adding your answer.

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