defter*
defter / katalog / CS 481
CS 481

Bioinformatics Algorithms

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.

Credit3ECTS5FacultyFaculty of EngineeringBölümComputer Engineering

Değerlendirme 90% — 3 adım

35%
25%
30%
Final:Essay/written Final exam 35%
Midterm:Essay/written Midterm 25%
Homework Programming assignments 30%

Önerilen kaynaklar 3 kitap

📖
Önerilen
An Introduction to Bioinformatics Algorithms
Neil Jones and Pavel Pevzner
2004 · MIT Press
📖
Önerilen
Algorithms on Strings
Trees, and Sequences: Computer Science and Computational Biology
Dan Gusfield · 1997
📖
Önerilen
Genome-Scale Algorithm Design
Veli Mäkinen, Djamal Belazzougui
Fabio Cunial · Alexandru I. Tomescu

Haftalık müfredat 14 hafta

Hafta 1
A brief introduction to computational complexity and algorithm design techniques
Hafta 2
DNA mapping & motif search. Introduction to exact string search algorithms.
Hafta 3
Exact string search algorithms.
Hafta 4
Exact string search (cont’d) and indexing.
Hafta 5
Elements of dynamic programming, Manhattan tourist problem, introduction to sequence alignment. Global alignment.
Hafta 6
Local alignment, linear space alignment. Bit-vector alignment algorithm.
Hafta 7
Four-Russians trick. Multiple sequence alignment. Partial order alignments.
Hafta 8
Heuristic sequence search. Short introduction to BLAST. Hash table indexes, minimizers and chaining.
Hafta 9
Maximal exact matches (MEMs), maximal unique matches (MUMs) to speed up search. Mapping tools such as BWA-MEM and minimap2. K-mer index structures (hash tables, minimizers, CQF). K-mer “containers” (Bloom filters, SBTs, BSTs).
Hafta 10
Alignment-free k-mer composition analysis. Minimum perfect hashing, MinHash, Jaccard Index.
Hafta 11
Phylogenic tree construction.
Hafta 12
Graphs in genome analysis. OLC, de Bruijn, string graphs. Aligning reads to graphs.
Hafta 13
Applications: short introduction to genome sequencing. Current platforms and data types. Standard file formats.
Hafta 14
Applications: programming libraries, application-specific programming languages.

🤖 GenAI politikası

Use of GenAI for homeworks is prohibited in this course.

Ders notları — henüz yok

CS 481 için defter ekibi henüz not yazmadı.

İ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.

← katalog

Geçmiş GPA dağılımı 11 dönem · ort. 2.52

DönemCourse 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.

⚠️ FZ engelleyen şartlar

At least 30% average on homeworks, and 30% on quizzes required.

Hocalar 1 bu dönem · 1 geçmiş

Bu dönem (2025-2026 Spring) · 1 section
Can Alkan
Geçmişte ders veren (1 kişi)
Süleyman Şahinalp