Go back to Game Selection

Sequence Alignment Dynamic Programming Game

Match Score :
Mismatch Score :
Gap Score :

HOW TO PLAY

  • Fill in the dynamic programming matrix below for the Needleman-Wunsch global sequence alignment algorithm.
  • Click on an empty cell to fill in the score.
  • Click on a filled cell to see the best sequence alignment up to that cell.
# A C G T

↘ : match/mismatch
↓ : gap in W
→ : gap in V

Alignment score

Best Alignment Path





Created by Minji Kim, Yeonsung Kim, Lei Qian, and Jun S. Song.