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:09:52

Text rand64 (alphabet : 64 - size : 1048576 bytes)

24816326412825651210242048409600000
BF
1.92
1.93
1.92
1.90
1.93
1.89
1.88
1.91
1.90
1.92
1.82
1.87
-
-
-
-
-
BM
3.71
1.97
1.09
0.65
0.43
0.36
0.31
0.30
0.29
0.30
0.30
0.32
-
-
-
-
-
TW
2.24
2.09
2.29
2.30
2.29
2.22
2.39
2.33
2.34
2.35
2.29
2.32
-
-
-
-
-
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.