We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Python implementation of the counting algorithm using a dictionary (hash map) that does exactly one thing:
Given several 32-mers and a sequence, returns the count of how many times each 32-mer was found in the sequence.
def do_count(mers, seq): pass
The text was updated successfully, but these errors were encountered:
sarahsummerfield
No branches or pull requests
Python implementation of the counting algorithm using a dictionary (hash map) that does exactly one thing:
Given several 32-mers and a sequence, returns the count of how many times each 32-mer was found in the sequence.
The text was updated successfully, but these errors were encountered: