Database Reference
In-Depth Information
74.13
74.13
74.13
74.13
74.13
0
0
0
0
0
100
100
100
100
100
133
133
133
133
133
40
0
94.26
40
0
94.26
40
0
94.26
40
0
94.26
40
0
94.26
74.13
74.13
74.13
74.13
74.13
0
0
0
0
0
100
100
100
100
100
133
133
133
133
133
40
0
94.26
40
0
94.26
40
0
94.26
40
0
94.26
40
0
94.26
76
76
76
76
76
0
0
0
0
0
100
100
100
100
100
154.6
154.6
154.6
154.6
154.6
62.85
0
100 147.5
62.85
0
100 147.5
62.85
0
100 147.5
62.85
0
100 147.5
62.85
0
100 147.5
76
76
76
76
76
0
0
0
0
0
100
100
100
100
100
154.6
154.6
154.6
154.6
154.6
62.85
0
100 147.5
62.85
0
100 147.5
62.85
0
100 147.5
62.85
0
100 147.5
62.85
0
100 147.5
59
59
59
59
59
0
0
0
0
0
100
100
100
100
100
188
188
188
188
188
64.54
0
100
161.7
64.54
0
100
161.7
64.54
0
100
161.7
64.54
0
100
161.7
64.54
0
100
161.7
59
59
59
59
59
0
0
0
0
0
100
100
100
100
100
188
188
188
188
188
64.54
0
100
161.7
64.54
0
100
161.7
64.54
0
100
161.7
64.54
0
100
161.7
64.54
0
100
161.7
95.62
95.62
95.62
95.62
95.62
0
0
0
0
0
100
100
100
100
100
223
200
223
200
223
200
223
200
223
200
154.9 100
0
96
154.9 100
0
96
154.9 100
0
96
154.9 100
0
96
154.9 100
0
96
95.62
95.62
95.62
95.62
95.62
0
0
0
0
0
100
100
100
100
100
154.9 100
223
200
154.9 100
223
200
154.9 100
223
200
154.9 100
223
200
223
200
0
96
0
96
0
96
0
96
154.9 100
0
96
Fig. 2. Samples of digits 1, 2, 3 and 6, respectively.
dynamic process into account, the dynamic algorithm is attractive com-
pared to static ones such as the greedy algorithm. If we use the static
greedy algorithm to handle the same dynamic process, then the computa-
tion for digit 3, for instance, would require 46.10 seconds in contrast to 22.8
seconds of the dynamic approach. Considering the computational eciency
alone, set median is the best among the compared methods. But the gener-
alized median string is a more precise abstraction of the given set of strings
with a smaller consensus error.
