Description Usage Arguments Value Author(s) References Examples
View source: R/needleman-wunsch.R
Verbatim implementation of Needleman-Wunsch matching algorithm.
1 | alignS(s.matrix, gap = -1)
|
s.matrix |
Similarity matrix. See sMatrix(...). |
gap |
Penality assigned to a gap (missing or extra value). |
2 column matrix. First column = similarity matrix rows (first sequence), Second column = similarity matrix columns (second sequence). Each row maps aligned indexs from each sequence:
1 2 3 4 5 6 7 |
phil
https://en.wikipedia.org/wiki/Needleman-Wunsch_algorithm
1 2 3 4 5 6 7 8 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.