Lecture 05B
Sequence alignment
Methodology
Date: Feb 6, 2024
Learning objectives¶
After today, you should have a better understanding of:
- Dynamic programming basics in bioinformatics.
- Needleman‐Wunsch algorithm (global alignment).
- Smith‐Waterman algorithm (local alignment).
Activity¶
You can find the Python activity here.
Supplementary material¶
Relevant content for today's lecture.
- Global alignment
- Local alignment
- Online tools for Needleman-Wunsch and Smith-Waterman.
Old videos.
Presentation¶
- View: slides.com/aalexmmaldonado/biosc1540-l05b
- Live link: slides.com/d/0y5mCfU/live
- Download: biosc1540-l05b.pdf