Talk:Needleman–Wunsch algorithm
Appearance
i think there's an error in the formula for the iteration of the algorithm: it currently reads:
Fij = max(Fi − 1,j − 1 + S(Ai − 1,Bj − 1),Fi,j − 1 + d,Fi − 1,j + d)
i think it should read
Fij = max(Fi − 1,j − 1 + S(Ai,Bj),Fi,j − 1 + d,Fi − 1,j + d)
(the suffices in S(A,B) need changing) as i'm new to dynamic programming, i'm not sure about this.
any ideas anyone?