Difference between revisions of "Jellyfish"
Line 2: | Line 2: | ||
|sw summary=Fast, memory-efficient k-mer counting algorithm | |sw summary=Fast, memory-efficient k-mer counting algorithm | ||
|created by=Guillaume Marçais, Carl Kingsford | |created by=Guillaume Marçais, Carl Kingsford | ||
− | |created at=University of Maryland, | + | |created at=University of Maryland, |
− | |language=C++, | + | |email address=gmarcais@umd.edu |
− | |licence=GPLv3, | + | |language=C++, |
− | |os=Linux 64, Mac OS X, | + | |licence=GPLv3, |
+ | |os=Linux 64, Mac OS X, | ||
}} | }} | ||
== Description == | == Description == |
Latest revision as of 19:57, 3 December 2015
Application data |
|
Created by | Guillaume Marçais, Carl Kingsford |
---|---|
Created at | University of Maryland |
Maintained? | Maybe |
Programming language(s) | C++ |
Licence | GPLv3 |
Operating system(s) | Linux 64, Mac OS X |
Contact: | gmarcais@umd.edu |
Summary: Fast, memory-efficient k-mer counting algorithm
"Error: no local variable "counter" was set." is not a number.
Description
JELLYFISH is a tool for fast, memory-efficient counting of k-mers in DNA. 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 using an order of magnitude less memory and an order of magnitude faster than other k-mer counting packages by using an efficient encoding of a hash table and by exploiting the "compare-and-swap" CPU instruction to increase parallelism.
JELLYFISH is a command-line program that reads FASTA and multi-FASTA files containing DNA sequences. It outputs its k-mer counts in an binary format, which can be translated into a human-readable text format using the "jellyfish dump" command. See the documentation below for more details.
Links
References
To add a reference for Jellyfish, enter the PubMed ID in the field below and click 'Add'.
Search for "Jellyfish" in the SEQanswers forum / BioStar or:
Web Search | Wiki Sites | Scientific |
---|---|---|