top of page
Lesson 5.1
Lesson 5.1
Cracking the Non-Ribosomal Code
Lesson 5.2
Lesson 5.2
Introduction to Sequence Alignment
Lesson 5.3
The Manhattan Tourist Problem
Lesson 5.3
Lesson 5.4
Lesson 5.4
Sequence Alignment is the Manhattan Tourist Problem in Disguise
Lesson 5.5
An Introduction to Dynamic Programming: The Change Problem
Lesson 5.5
Lesson 5.6
The Manhattan Tourist Problem Revisited
Lesson 5.6
Lesson 5.7
From Manhattan to an Arbitrary DAG
Lesson 5.7
Lesson 5.8
Backtracking in the Alignment Graph
Lesson 5.8
Lesson 5.9
Scoring Alignment
Lesson 5.9
Lesson 5.10
From Global to Local Alignment
Lesson 5.10
Lesson 5.11
The Changing Faces of Sequence Alignment
Lesson 5.11
Penalizing Insertions and Deletions in Sequence Alignment
Lesson 5.12
Lesson 5.12
Space Efficient Sequence Alignment
Lesson 5.13
Lesson 5.13
Multiple Sequence Alignment
Ch.5 Epilogue
Epilogue
bottom of page