Needleman and Wunsch Algorithm

Written by richa January 10, 2013

1)This algorithm helps in sequence comparison whether DNA or protein

2) It gives a similarity score which if maximized gives a "maximum match"

3)We get  a maximum match by searching for maximum no. of residues that match other sequence by allowing maximum no. of deletions

4)This algorithm is used to find a global ar whole sequence match

5)It is based on  matrix method of calculation

 

For more on needleman and wunsch plz visit http://www.maths.tcd.ie/~lily/pres2/sld004.htm


Leave a Comment

Fields with * are required.

Please enter the letters as they are shown in the image above.
Letters are not case-sensitive.