You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Notes from Anton:
Computational Complexity - Big O Notation.
This comes up a lot in the bioinformatics algorithms where I’m trying to explain why some sequence alignment algorithms are significantly faster than others. O(mn) vs O(mn^2) or O(m+n) or O(mn^3) for multiple sequence alignment. It caused a lot of confusion.
There’s a nice example of something here:
The text was updated successfully, but these errors were encountered:
Notes from Anton:
Computational Complexity - Big O Notation.
This comes up a lot in the bioinformatics algorithms where I’m trying to explain why some sequence alignment algorithms are significantly faster than others. O(mn) vs O(mn^2) or O(m+n) or O(mn^3) for multiple sequence alignment. It caused a lot of confusion.
There’s a nice example of something here:
The text was updated successfully, but these errors were encountered: