Needleman-Wunsch Algorithm (cont.)

• Three main steps

• 1. Assign similarity values
  
  
  2. For each cell, look at all possible pathways back to the beginning of the sequence (allowing insertions and deletions) and give that cell the value of the maximum scoring pathway
  
  3. Construct an alignment (pathway) back from the highest scoring cell to give the highest scoring alignment

Previous slide

Next slide

Back to first slide

View graphic version