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

Text italianTexts (alphabet : 128 - size : 1048576 bytes)

24816326412825651210242048409600000
BF
2.69
2.93
2.77
2.76
2.80
2.71
2.72
2.84
2.80
2.72
2.76
2.78
-
-
-
-
-
BM
4.19
2.40
1.42
0.92
0.66
0.54
0.45
0.39
0.35
0.32
0.31
0.31
-
-
-
-
-
TW
3.02
2.89
2.62
2.68
2.48
2.28
2.18
2.03
2.09
2.13
2.15
2.05
-
-
-
-
-
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.