Smith-Waterman Algorithm
Instead of looking at each sequence in its entirety this compares segments of all possible lengths (LOCAL alignments) and chooses whichever maximise the similarity measure
For every cell the algorithm calculates ALL possible paths leading to it. These paths can be of any length and can contain insertions and deletions