-
Notifications
You must be signed in to change notification settings - Fork 103
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
Implement k-mer subsetting methods #510
Merged
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
padix-key
force-pushed
the
minimizer
branch
2 times, most recently
from
December 1, 2023 14:21
d25ca0a
to
dc0ee6b
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR adds modern k-mer subsetting methods (e.g. minimizers and syncmers) to allow more rapid sequence matching:
MinimizerSelector
SyncmerSelector
CachedSyncmerSelector
MincodeSelector
The implemented methods are based on finding the 'smallest' k-mer in a certain window. As the k-mer code itself would imply lexicographical sorting, different permutation schemes are implemented:
Permutation
RandomPermutation
FrequencyPermutation
To support the long k-mers that are typically used in modern read mapping methods, the
BucketKmerTable
is introduced as memory-efficient twin of theKmerTable
.Furthermore, an example is introduced that demonstrates gene counting using a combination of the new features.