Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Increase the allowed minimum overlap length #404

Closed
wants to merge 1 commit into from

Conversation

eernst
Copy link

@eernst eernst commented Jul 9, 2021

With very long ONT reads and sufficient coverage, using a larger -m than the allowed default seems to produce better assemblies with fewer contigs in some cases than just prefiltering input reads by length, which also prevents shorter reads from contributing to polishing.

It looks to me like the 10Kbp upper bound was arbitrary, and I don't haven't seen an indication of unexpected side effects of using values here like 20Kbp. Of course, increasing this parameter leads to lower coverage during graph construction, just as with prefiltering input reads.

With very long ONT reads and sufficient coverage, using a larger -m than the allowed default seems to produce better assemblies with fewer contigs in some cases than just prefiltering input reads by length, which also prevents shorter reads from contributing to polishing. 

It looks to me like the 10Kbp upper bound was arbitrary, and I don't haven't seen an indication of unexpected side effects of using values here like 20Kbp. Of course, increasing this parameter leads to lower coverage during graph construction, just as with prefiltering input reads.
@mikolmogorov
Copy link
Owner

Minimum overlap parameter does not affect polishing. Unless there is any evidence of better assemblies minimum overlap >10k, I'd rather stick with the tried-and-tested parameter settings.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants