In this video I will discuss the components of a sequence alignment algorithm, specifically with the NeedlemanWunsch algorithm as an example. Many of these properties will also apply to SmithWaterman, but not all. NeedlemanWunsch is a global alignment algorith, meaning it aligns the entire sequences to each other, instead of the local alignment provided by SmithWaterman.
0
0
Related videos
Preparing
To view the site materials you should be more than or equal to 18 years old