Smith-Waterman Algorithm Step-by-step Explanations - видео

Smith-Waterman algorithm is a dynamic programming approach used to solve pairwise local sequence alignment. It involves computing a two-dimensional 2D matrix using the match mismatch and gap penalty scores. Solving the matrix consist of three stages: 1 initialization 2 matrix filling and 3 traceback. Temple Ferris Smith and Michael Spencer Waterman introduced this algorithm during the year 1981. This video tutorial contains step-by-step explanations to solve Smith-Waterman algorithm. For the matr...
Источник видео: RuTube.ru (Технологии и интернет)