back-tracing step: collect clustered segments from the scoring matrix
S(i,c)
by back-tracing the position j=k
which delivered
the maximal score at position i
.
1 |
S |
matrix S, containing the local scores |
K |
matrix K, containing the position k used for score maximization |
multib |
if multiple k produce the maximal score, take either the
shortest k ("max") or the longest k ("min"); if |
nextmax |
proceed backwards while score is increasing before opening a new segment |
verb |
print messages |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.