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:02

Text rand32 (alphabet : 32 - size : 1048576 bytes)

24816326412825651210242048409600000
BF
2.18
2.24
2.14
2.20
2.24
2.20
2.12
2.03
2.16
2.17
2.12
2.22
-
-
-
-
-
BM
3.81
2.09
1.16
0.71
0.52
0.45
0.41
0.41
0.41
0.41
0.41
0.42
-
-
-
-
-
TW
2.56
2.38
2.48
2.52
2.52
2.35
2.42
2.48
2.50
2.60
2.55
2.45
-
-
-
-
-
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.