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:11:25

Text rand250 (alphabet : 250 - size : 1048576 bytes)

24816326412825651210242048409600000
BF
1.66
1.67
1.67
1.55
1.69
1.66
1.65
1.67
1.69
1.66
1.62
1.71
-
-
-
-
-
BM
3.63
1.90
1.04
0.60
0.38
0.28
0.24
0.26
0.28
0.28
0.29
0.31
-
-
-
-
-
TW
2.03
2.01
2.09
2.16
1.98
2.12
2.12
2.09
2.14
2.12
2.01
2.08
-
-
-
-
-
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.