Table 2 Elapsed-time and speed-up comparisons of ACSMF and ACSMF-Simple for n =10MB
From: Fast algorithms for approximate circular string matching
Elapsed Time (s) | Speed-up of ACSMF-Simple | |||
|---|---|---|---|---|
m | k k | ACSMF | ACSMF-Simple | ACSMF |
10000 | 100 | 6.54 | 0.67 | 10 |
11000 | 100 | 6.69 | 0.70 | 10 |
12000 | 100 | 6.57 | 0.72 | 9 |
13000 | 100 | 6.64 | 0.74 | 9 |
14000 | 100 | 6.58 | 0.75 | 9 |
10000 | 300 | 6.54 | 0.69 | 9 |
11000 | 300 | 6.67 | 0.69 | 10 |
12000 | 300 | 6.64 | 0.68 | 10 |
13000 | 300 | 6.71 | 0.71 | 9 |
14000 | 300 | 6.63 | 0.72 | 9 |
10000 | 500 | 6.74 | 0.66 | 10 |
11000 | 500 | 6.58 | 0.67 | 10 |
12000 | 500 | 6.69 | 0.66 | 10 |
13000 | 500 | 6.66 | 0.67 | 10 |
14000 | 500 | 6.71 | 0.68 | 10 |