SMARTString Matching Algorithms Research Tool

by Simone Faro - www.dmi.unict.it/~faro/smart/ - email: faro@dmi.unict.it

Report of Experimental Results

Test Code EXP1499166179

Date 2017:07:04 14:02:59

Text rand2 (alphabet : 2 - size : 1048576 bytes)

24816326412825651210242048409600000
BF
11.14
11.61
11.30
10.95
10.43
9.97
9.48
8.76
8.43
7.95
7.69
7.53
-
-
-
-
-
BM
11.53
9.55
6.53
3.53
2.64
2.05
1.72
1.44
1.25
1.02
0.96
0.85
-
-
-
-
-
TW
11.21
9.39
8.82
8.04
7.57
7.34
6.82
6.52
6.28
6.29
6.21
6.25
-
-
-
-
-
Table 1. Running times of experimental tests n.EXP1499166179. Each time value is the mean of 500 runs. Running times are in milliseconds.
Average Running Times
[No canvas support]
BF
BM
TW


Chart 1. Plot of the running times of experimental tests n.EXP1499166179. The x axes reports the length of the pattern (in a log scale) while the y axes reports the running time in milliseconds.
Worst Running Times
[No canvas support]
Best Running Times
[No canvas support]
BF algorithm
[No canvas support]
Detailed plot of the running times relative to the BF algorithm. The plot reports the mean and the distribution of the running times.
BM algorithm
[No canvas support]
Detailed plot of the running times relative to the BM algorithm. The plot reports the mean and the distribution of the running times.
TW algorithm
[No canvas support]
Detailed plot of the running times relative to the TW algorithm. The plot reports the mean and the distribution of the running times.