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:06:56

Text rand8 (alphabet : 8 - size : 1048576 bytes)

24816326412825651210242048409600000
BF
3.48
3.66
3.48
3.57
3.61
3.54
3.50
3.57
3.59
3.51
3.47
3.59
-
-
-
-
-
BM
4.64
2.73
1.74
1.28
1.14
1.13
1.03
1.00
0.93
0.88
0.86
0.81
-
-
-
-
-
TW
3.46
3.34
3.16
3.28
3.41
3.32
3.44
3.39
3.35
3.20
3.30
3.35
-
-
-
-
-
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.