Dynamic Programming: Needleman-Wunsch & Smith-Waterman

A deep dive into the mathematical algorithms behind optimal sequence alignment, scoring matrices, and gap penalties.

Free. No account needed for your first five quizzes.

Sample Questions

What You'll Be Asked

What is the time complexity of a standard pairwise alignment between two sequences of length N?
The initialization of the first row and column in Needleman-Wunsch represents ________.
Dynamic programming is guaranteed to find the mathematically optimal alignment.

12 more questions in the quiz. Your score and the right answers come at the end.

Keep Practicing

Articles