Example: quiz answers
Lecture 2 Pairwise sequence alignment.

Lecture 2 Pairwise sequence alignment.

Back to document page

Dynamic programming algorithm for computing the score of the best alignment For a sequence S = a 1, a 2, …, a n let S j = a 1, a 2, …, a j S,S’ – two sequences Align(S i,S’ j) = the score of the highest scoring alignment between S1 i,S2 j S(a i, a’ j)= similarity score between amino acids a i and a j given by a scoring matrix like ...

  Programming, Dynamics, Sequence, Alignment, Dynamic programming, Sequence alignment

Download Lecture 2 Pairwise sequence alignment.


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries