A - Algorithms
The way an algorithm works is very simple. It compares all selected OTU's and local similarity coefficient is produced.
|
Source:
|
State:
|
?
|
-
|
w
|
-, d, w
|
+
|
+, d, w
|
d
|
-, +
|
|
|
Value:
|
0
|
1
|
3
|
4
|
5
|
6
|
7
|
8
|
Reference:
|
|
|
|
|
|
|
|
|
|
|
State:
|
Value:
|
|
|
|
|
|
|
|
|
|
?
|
0
|
|
NaN
|
NaN
|
NaN
|
NaN
|
NaN
|
NaN
|
NaN
|
NaN
|
-
|
1
|
|
NaN
|
1
|
1
|
1
|
0
|
1
|
1
|
1
|
w
|
3
|
|
NaN
|
1
|
1
|
1
|
1
|
1
|
1
|
1
|
-, d, w
|
4
|
|
NaN
|
1
|
1
|
1
|
1
|
1
|
1
|
1
|
+
|
5
|
|
NaN
|
0
|
1
|
1
|
1
|
1
|
1
|
1
|
+, d, w
|
6
|
|
NaN
|
1
|
1
|
1
|
1
|
1
|
1
|
1
|
d
|
7
|
|
NaN
|
1
|
1
|
1
|
1
|
1
|
1
|
1
|
-, +
|
8
|
|
NaN
|
1
|
1
|
1
|
1
|
1
|
1
|
1
|
NaN means “Not a Number”. This is a value that cannot be computed.
Value 2 is not used for technical reasons.
A similarity coefficient (Sm) is computed for all tests.
All results are accounted except the one(s) showing a 'NaN' result.