Table 1 Comparison of different algorithms.
From: New decoding algorithms for Hidden Markov Models using distance measures on labellings
Starting set | Local optimization | Phobius measure | τ= 5 | runtime |
|---|---|---|---|---|
10 samples, r = 6 | Yes | 162 | 92 | 132 m34 s |
10 samples, r = 5 | Yes | 160 | 93 | 119 m53 s |
Phobius | No | 166 | 79 | n/a |
Phobius | Yes | 166 | 94 | 8 m53 s |
9 samples+Phobius | Yes | 161 | 93 | 119 m33 s |
10 best | Yes | 141 | 75 | 116 m38 s |