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:05:26

Text rand4 (alphabet : 4 - size : 1048576 bytes)

24816326412825651210242048409600000
BF
5.09
5.35
5.38
5.40
5.39
5.38
5.32
5.33
5.36
5.28
5.29
5.28
-
-
-
-
-
BM
5.63
3.80
2.86
2.36
2.05
1.77
1.57
1.44
1.31
1.10
0.99
0.93
-
-
-
-
-
TW
4.88
4.53
4.26
4.37
4.40
4.49
4.57
4.58
4.68
4.61
4.51
4.59
-
-
-
-
-
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.