Answer Posted / Shrikant Gupta
The Needleman-Wunsch algorithm is a dynamic programming algorithm for global sequence alignment. It compares two sequences and finds an optimal alignment with the highest score, taking into account both substitutions and gaps. The algorithm calculates scores for each possible alignment path using a matrix of scores for matching characters, mismatching characters, inserting a gap, and deleting a gap.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
