I am looking for the differences between Dynamic Time Warping and Needleman-Wunsch algorithm.
Basically, they both find an alignment score. I need to calculate alignment (similarity) score between short sequence of strings (<20 characters) and there are a couple of thousands of them.
I wasn't able to figure out the differences between the two algorithms and decide which one to choose for my work. Can anyone please clear me the differences?