ee6e0c4336
A k-mer is a substring of length k, and counting the occurrences of all such substrings is a central step in many analyses of DNA sequence. JELLYFISH can count k-mers quickly by using an efficient encoding of a hash table and by exploiting the "compare-and-swap" CPU instruction to increase parallelism. WWW: http://www.genome.umd.edu/jellyfish.html PR: 207929 Submitted by: bacon4000@gmail.com
2 lines
166 B
Text
2 lines
166 B
Text
SHA256 (gmarcais-Jellyfish-v2.2.4_GH0.tar.gz) = 44b6478aed63b859b8287d72b4f9bfb5d513fed334efbc8a9e5783da12ecb3ec
|
|
SIZE (gmarcais-Jellyfish-v2.2.4_GH0.tar.gz) = 658653
|