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:13:04

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

24816326412825651210242048409600000
BF
2.78
2.62
2.78
2.81
2.80
2.92
2.77
2.73
2.71
2.71
2.80
2.81
-
-
-
-
-
BM
4.04
2.36
1.39
0.91
0.67
0.54
0.45
0.39
0.37
0.34
0.33
0.32
-
-
-
-
-
TW
2.82
2.89
3.06
3.22
2.82
2.61
2.24
2.11
2.18
2.24
2.21
2.04
-
-
-
-
-
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.