Table 3 Running time, in seconds, on large-|Σ| inputs. (k, m) instances denote implanted motifs of length k with up to m substitutions.
From: Efficient motif finding algorithms for large-alphabet inputs
|Σ| | (9,2) | (11,3) | (13,4) | (15,5) | ||||
|---|---|---|---|---|---|---|---|---|
MITRA | Stemming | MITRA | Stemming | MITRA | Stemming | MITRA | Stemming | |
20 | 8.39 | 0.637 | 1032.17 | 1.07 | 28905 | 5.247 | n/a | 12.31 |
50 | 89.82 | 0.633 | 12295.73 | 0.963 | 685015 | 2.244 | n/a | 11.92 |
100 | 265.94 | 0.645 | n/a | 0.967 | > 1 month | 2.227 | n/a | 11.86 |