Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
teaching:2025winter:algbioinf [2025/10/29 11:21]
luca [Details on the k-mer counting exercise]
teaching:2025winter:algbioinf [2025/12/10 14:21] (current)
luca [Timetable]
Line 59: Line 59:
 | 3.12. | Mitan | Sparse and skew hashing of K-mers. | | 3.12. | Mitan | Sparse and skew hashing of K-mers. |
 | 10.12. | Kiril | Space-efficient and exact de Bruijn graph representation based on a Bloom filter. (Minia)| | 10.12. | Kiril | Space-efficient and exact de Bruijn graph representation based on a Bloom filter. (Minia)|
-| 17.12. | Nicola | Efficient q-gram filters ​|+| 17.12. | - 
 | 14.1. | Tom | Velvet: algorithms for de novo short read assembly using de Bruijn graphs. | | 14.1. | Tom | Velvet: algorithms for de novo short read assembly using de Bruijn graphs. |
-| 21.1. | Nils |Mash: fast genome and metagenome distance estimation using MinHash. | +| 21.1. | Nils & John |Mash: fast genome and metagenome distance estimation using MinHash. ​ & ​  Fast gapped k-mer (cuckoo hash tables)  ​
 | 28.1. | Mehran | Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. |  | 28.1. | Mehran | Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. | 
-| 4.2. | John Fast gapped k-mer (cuckoo hash tables) ​|+| 4.2. | Nicola ​Efficient q-gram filters ​|
 | 25.2. | Elif | Fimpera |  | 25.2. | Elif | Fimpera | 
 | 4.3. | -- | | 4.3. | -- |