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
I've been using mmseqs2 a lot, and one of its uses is an alternative to blastn. Indeed, the idea of prefiltering hits, especially for large k values, makes a lot of sense as it decreases the run time compared to blastn.
Current Behavior
However, I have found that when compared to blastn without the prefiltering, mmseqs search is much slower than blastn. I would like to understand if this is a consequence of some parameters and there is a way to accelerate it, or whether it's a more fundamental problem.
I want to know if mmseqs search is a viable alternative to blastn for intermediate values of k (eg k=11) which should give comparable accuracy to blastn at a fraction of speed.
Your Environment
Include as many relevant details about the environment you experienced the bug in.
Git commit used (The string after "MMseqs Version:" when you execute MMseqs without any parameters): 15-6f452
Which MMseqs version was used (Statically-compiled, self-compiled, Homebrew, etc.): homebrew
For self-compiled and Homebrew: Compiler and Cmake versions used and their invocation:
Server specifications (especially CPU support for AV
X2/SSE and amount of system memory): Apple M2 Max, 64GB of memory
Operating system and version: Mac OS 14.5 (23F79)
The text was updated successfully, but these errors were encountered:
Expected Behavior
I've been using mmseqs2 a lot, and one of its uses is an alternative to blastn. Indeed, the idea of prefiltering hits, especially for large k values, makes a lot of sense as it decreases the run time compared to blastn.
Current Behavior
However, I have found that when compared to blastn without the prefiltering, mmseqs search is much slower than blastn. I would like to understand if this is a consequence of some parameters and there is a way to accelerate it, or whether it's a more fundamental problem.
Steps to Reproduce (for bugs)
Here is the code to reproduce my results.
BLASTN
MMSEQS
The resulting runtimes are roughly 30s for blastn and 4m for mmseqs. The files needed to reproduce this are provided as a ZIP.
input.zip
MMseqs Output (for bugs)
https://gist.github.com/rmostowy/f08c6389e9e04a380a03ffc03c3bfa85
Context
I want to know if mmseqs search is a viable alternative to blastn for intermediate values of k (eg k=11) which should give comparable accuracy to blastn at a fraction of speed.
Your Environment
Include as many relevant details about the environment you experienced the bug in.
X2/SSE and amount of system memory): Apple M2 Max, 64GB of memory
The text was updated successfully, but these errors were encountered: