-
© Universität Bielefeld
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
teaching:2025summer:kmer_algbioinf [2025/06/16 13:48] rwittler [Timetable] |
teaching:2025summer:kmer_algbioinf [2025/06/17 09:05] (current) rwittler [Timetable] |
||
|---|---|---|---|
| Line 64: | Line 64: | ||
| | 21.05. | k-mer counting challenge | (fast) alle | | | 21.05. | k-mer counting challenge | (fast) alle | | ||
| | 28.05. | -- | | | 28.05. | -- | | ||
| - | | 04.05. | Fast gapped //k//-mer counting with subdivided multi-way bucketed Cuckoo hash table | Sofie | | + | | 04.06. | Fast gapped //k//-mer counting with subdivided multi-way bucketed Cuckoo hash table | Sofie | |
| | | Minimizer-space de Bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer | Liliana | | | | Minimizer-space de Bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer | Liliana | | ||
| - | | 11.06. | Velvet: algorithms for de novo short read assembly using de Bruijn graphs | Simon | | + | | 11.06. | Sparse and skew hashing of K-mers | Alena | |
| - | | | Sparse and skew hashing of K-mers | Alena | | + | |
| | 18.06. | Space-efficient and exact de Bruijn graph representation based on a Bloom filter. (Minia) | Max | | | 18.06. | Space-efficient and exact de Bruijn graph representation based on a Bloom filter. (Minia) | Max | | ||
| | 25.06. | Minimap2: pairwise alignment for nucleotide sequences | Igor | | | 25.06. | Minimap2: pairwise alignment for nucleotide sequences | Igor | | ||
teaching/2025summer/kmer_algbioinf.1750074505.txt.gz · Last modified: 2025/06/16 13:48 by rwittler
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International