Differences

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

--- teaching:2025winter:algbioinf [2025/10/22 11:15]
luca
+++ 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. |
 | 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 | 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. |
-| 4.2. | John | Bifrost |
+| 4.2. | Nicola | Efficient q-gram filters |
-| 25.2. | -- |
+| 25.2. | Elif | Fimpera |
 | 4.3. | -- |
 | 11.3. | -- |
@@ Line 75: / Line 75: @@
   * Multiple fasta file, containing nucleotide sequences (small or capital letters, maybe N's)
   * //k//-mer length **k**
-  * threshold **c**
+  * cutoff **c** : a //k//-mer must appear at least **c** times in the same fasta file to be counted.
 **Output:**

Genome Informatics