An implementation of the Smith-Waterman algorithm with Gotoh's improvement for biological local pairwise sequence alignment.
Recursive definition:
-
Base conditions:
-
V(0, 0) = 0
-
V(i, 0) = E(i, 0) = Wg + iWs
-
V(0, j) = F(0, j) = Wg + jWs
-
Recurrence relation:
-
V(i, j) = max{E(i, j), F(i, j), G(i, j)}, where:
-
G(i, j) = V(i - 1, j - 1) + similarity(Si, Tj)
-
E(i, j) = max{E(i, j - 1) + Ws, V(i, j - 1) + Wg + Ws}
-
F(i, j) = max{F(i - 1, j) + Ws, V(i - 1, j) + Wg + Ws}
- Author
- Ahmed Moustafa (ahmed.nosp@m.@use.nosp@m.rs.sf.nosp@m..net)