Differences

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

--- teaching:2025winter:algbioinf [2025/10/22 08:54]
luca created
+++ teaching:2025winter:algbioinf [2025/10/22 11:26] (current)
luca [Timetable]
@@ Line 1: / Line 1: @@
-| [[https://ekvv.uni-bielefeld.de/kvv_publ/publ/vd?id=514778069|392219]] | Parmigiani | Winter 2025/26 | Wednesday 10:15-11:45 | U10-146 |
+| [[https://ekvv.uni-bielefeld.de/kvv_publ/publ/vd?id=565881647|392107]] | Parmigiani | Winter 2025/26 | Wednesday 10:15-11:45 | U10-146 |
 This course is held in English.\\
@@ Line 47: / Line 47: @@
   * Giulio Ermanno Pibir. "Sparse and skew hashing of K-mers." [[https://academic.oup.com/bioinformatics/article/38/Supplement_1/i185/6617506?login=true|Bioinformatics 38.Suppl1 (2022):i185-i194.]]
-==== Pangenomics ====
-  * Luca Parmigiani, Roland Wittler, and Jens Stoye. “Revisiting pangenome openness with k-mers.” [[https://peercommunityjournal.org/item/10.24072/pcjournal.415.pdf|Peer Community Journal (4):e47 (2024)]]
 ==== Timetable ====
@@ Line 60: / Line 57: @@
 | 19.11. | Pseudocode presentation |
 | 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. | -- |
 | 4.3. | -- |

Genome Informatics

Differences