Introduction - If you have any usage issues, please Google them yourself
Solve the sequence alignment score matrix for two sequences S and T, so [S] and [T] S and T respectively, sequence length, S [i] and T [j] (which is an integer i, j satisfying 0 ≤ j < [S] and 0 ≤ j < [T]) belong to the character set Ω = {A, T, C, G,-}, any element of Ω, and the empty symbols. Design S [i] and T [j] between any two of a record score to compare the sequence identity between the pros and cons, with the score function σ (x, y) that, σ (S [i], T [j ]) = 2 (S [i] = T [j] ≠-) σ (S [i], T [j]) =-1 (S [i] ≠ T [j], S [i] ≠- , T [j] ≠-) σ (S [i], T [j]) =-2 (S [i] orT [j ]=-)。