This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
teaching:2025winter:algbioinf [2025/10/22 09:44] luca [Pangenomics] |
teaching:2025winter:algbioinf [2025/10/22 11:26] (current) luca [Timetable] |
||
|---|---|---|---|
| Line 57: | Line 57: | ||
| | 19.11. | Pseudocode presentation | | | 19.11. | Pseudocode presentation | | ||
| | 26.11. | k-mer counting challenge | Everybody | | | 26.11. | k-mer counting challenge | Everybody | | ||
| - | | 3.12. | -- | | + | | 3.12. | Mitan | Sparse and skew hashing of K-mers. | |
| - | | 10.12. | -- | | + | | 10.12. | Kiril | Space-efficient and exact de Bruijn graph representation based on a Bloom filter. (Minia)| |
| - | | 17.12. | -- | | + | | 17.12. | Nicola | Efficient q-gram filters | |
| - | | 14.1. | -- | | + | | 14.1. | Tom | Tom Velvet: algorithms for de novo short read assembly using de Bruijn graphs. | |
| - | | 21.1. | -- | | + | | 21.1. | Nils |Mash: fast genome and metagenome distance estimation using MinHash. | |
| - | | 28.1. | -- | | + | | 28.1. | Mehran | Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. | |
| - | | 4.2. | -- | | + | | 4.2. | John | Fast gapped k-mer (cuckoo hash tables) | |
| - | | 11.2. | -- | | + | |
| | 25.2. | -- | | | 25.2. | -- | | ||
| | 4.3. | -- | | | 4.3. | -- | | ||