| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
|
|
| |
PR: 237868
Submitted by: pkubaj
Notes:
svn path=/head/; revision=501578
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Upstream changes since version 2.2.4:
- Fix compilation warnings/errors with newer version of gcc (5.3 & 6.1).
- Fix bug in parsing function that made it stop on sequences that consist
of only empty lines.
- New methods in bindings to enumerate the mers of a string.
Approved by: AMDmi3 (mentor)
Differential Revision: https://reviews.freebsd.org/D8204
Notes:
svn path=/head/; revision=428954
|
|
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
Notes:
svn path=/head/; revision=411785
|