Skip to content

Runtime? #58

Answered by Arkarachai
ilante asked this question in Q&A
Aug 24, 2021 · 2 comments · 3 replies
Discussion options

You must be logged in to vote

Hi Ilante,
Just roughly. These are based on amount of data.
Falcon (and most OLC based assemblers) O(n^2)
Arrow polishing/ Freebayes polishing and most mapper O(n); note that the main reason these two steps are expensive is because memory requirement
The rest of them are not expensive, so I never look in detail. I would guess they are O(n) too.

The actual computing cost is very hard to predict for genome assembly. repeat content does matter the most. For example, maize (2G) is actually more expensive than mammalian (3G). All genomes I ever work with that are bigger than 6G are always repetitive. However, some insect or algae genome even if it's just 1G could be repetitive as well.

Replies: 2 comments 3 replies

Comment options

You must be logged in to vote
1 reply
@ilante
Comment options

Comment options

You must be logged in to vote
2 replies
@ilante
Comment options

@Arkarachai
Comment options

Answer selected by ilante
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
2 participants