Jellyfish

Jellyfish counts k-mers in DNA sequences to provide fast, memory-efficient analysis of large next-generation sequencing datasets for downstream genomic tasks.

Key Features:

• K-mer counting: Counts k-mers (substrings of length k) within DNA sequences.
• K-mer length support: Supports counting k-mers up to 31 bases in length.
• Hash-table implementation: Implements a multithreaded, lock-free hash table optimized for k-mer counting.
• Parallelization: Exploits multicore parallelism via multithreading to increase throughput.
• Efficiency: Provides improved speed and memory efficiency compared to traditional k-mer counting methods.
• Target data: Designed to handle large datasets generated by next-generation sequencing technologies.
• Alternative approach: Serves as a more efficient alternative to suffix-array-based approaches for k-mer counting.

Scientific Applications:

• Genome assembly: Supplies k-mer frequency data used in genome assembly workflows.
• Error correction: Provides k-mer frequency information for error correction of sequencing reads.
• Multiple sequence alignment: Supports fast multiple sequence alignment methods that leverage k-mer counts.
• Repeat detection: Supplies k-mer frequency data for repeat detection analyses.

Methodology:

Performs parallel k-mer counting using a multithreaded, lock-free hash table optimized for k up to 31 bases and leverages multicore parallelism as an alternative to suffix-array-based string methods.