-
-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathAdditional algorithm 11 (out of context).html
50 lines (39 loc) · 3.06 KB
/
Additional algorithm 11 (out of context).html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
<!-- ############################################################################################################################## -->
<!-- # John Wiley & Sons, Inc. # -->
<!-- # # -->
<!-- # Book: Algorithms in Bioinformatics: Theory and Implementation # -->
<!-- # Author: Dr. Paul A. Gagniuc # -->
<!-- # # -->
<!-- # Institution: # -->
<!-- # University Politehnica of Bucharest # -->
<!-- # Faculty of Engineering in Foreign Languages # -->
<!-- # Department of Engineering in Foreign Languages # -->
<!-- # # -->
<!-- # Area: European Union # -->
<!-- # Date: 04/01/2021 # -->
<!-- # # -->
<!-- # Cite this work as: # -->
<!-- # Paul A. Gagniuc. Algorithms in Bioinformatics: Theory and Implementation. John Wiley & Sons, 2021, ISBN: 9781119697961. # -->
<!-- # # -->
<!-- ############################################################################################################################## -->
<script>
for(var i=0; i<=n_0; i++) {
m[i]=[];
t[i]=[];
for(var j=0; j<=n_1; j++) {
m[i][j]=0;
t[i][j]=0;
if (i>1) {m[i][0]=s[0][i-2];}
if (j>1) {m[0][j]=s[1][j-2];}
if (i==1 && j>1) {m[i][j]=m[i][j-1] + gap;}
if (j==1 && i>1) {m[i][j]=m[i-1][j] + gap;}
if(i>1 && j>1){
var A = m[i-1][j-1] + f(m[i][0],m[0][j]); // \
var B = m[i-1][j] + gap; // -
var C = m[i][j-1] + gap; // |
var D = 0;
m[i][j] = Math.max(A, B, C, D);
}
}
}
</script>