In this video I will discuss the components of a sequence alignment algorithm, specifically with the Needleman-Wunsch algorithm as an example. Many of these properties will also apply to Smith-Waterman, but not all. Needleman-Wunsch is a global alignment algorith, meaning it aligns the entire sequences to each other, instead of the local alignment provided by Smith-Waterman.
Негізгі бет Understanding Sequence Alignment Algorithms: with Needleman-Wunsch
Пікірлер: 40