Bioinformatics Algorithms is really a string-algorithms course dressed in biology: the central question is how you find structure, similarity, and assembly signal in DNA sequences that are too long and too noisy for naive methods to handle. You'll work through dynamic programming alignment (Needleman-Wunsch, Smith-Waterman), heuristic search like BLAST, k-mer indexing with hash tables and Bloom filters, and graph-based assembly, applying them on five homework sets plus a midterm and final that lean on tracing and adapting algorithms. It assumes you're comfortable with algorithm design and complexity from CS 473, and it's the natural bridge into genomics research, computational biology labs, and any work touching modern sequencing pipelines.
→ STARS müfredatı (resmi syllabus)
Use of GenAI for homeworks is prohibited in this course.
İlk dosyayı sen atarsan — not, slayt, geçmiş sınav, çözüm, cheat-sheet, ne varsa — defter ekibi öğrenci paylaşımlarından bu dersin notlarını yazar. Drive linki / PDF / ZIP, hepsi olur.
| Dönem | Course CPA | |
|---|---|---|
| 2024-2025 Spring | 1.71 | 1 sec · 38 öğr |
| 2023-2024 Spring | 2.42 | 1 sec · 49 öğr |
| 2022-2023 Fall | 3.12 | 1 sec · 24 öğr |
| 2021-2022 Fall | 2.10 | 1 sec · 21 öğr |
| 2020-2021 Fall | 2.46 | 1 sec · 25 öğr |
| 2019-2020 Fall | 2.60 | 1 sec · 37 öğr |
| 2017-2018 Fall | 2.97 | 1 sec · 22 öğr |
| 2016-2017 Fall | 2.93 | 1 sec · 28 öğr |
| 2013-2014 Fall | 2.51 | 1 sec · 26 öğr |
| 2012-2013 Fall | 2.61 | 1 sec · 13 öğr |
Aggregate course GPA — Bilkent STARS'tan public data. Hoca-bazlı per-section detayı için STARS evaluation report →. Öğrenci anket cevapları KVKK kapsamında defter'de tutulmaz.
At least 30% average on homeworks, and 30% on quizzes required.