Needleman-Wunsch DP: dp[i][j] = max(dp[i−1,j−1]+s, dp[i−1,j]+g, dp[i,j−1]+g)

Layer 3 — Biologyin the computational-biology subtree

Needleman-Wunsch (1970) is the foundational global-alignment algorithm for biological-sequence analysis. Inputs: two sequences a (length m) and b (length n) over an alphabet Σ (DNA: {A,C,G,T}; protein: 20-letter amino-acid set); a…

Related concepts

Explore Needleman-Wunsch DP: dp[i][j] = max(dp[i−1,j−1]+s, dp[i−1,j]+g, dp[i,j−1]+g) on the interactive knowledge graph →