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

Text rand16 (alphabet : 16 - size : 1048576 bytes)

24816326412825651210242048409600000
BF
2.64
2.69
2.65
2.66
2.74
2.58
2.69
2.69
2.69
2.72
2.72
2.73
-
-
-
-
-
BM
4.04
2.27
1.31
0.88
0.70
0.65
0.65
0.62
0.61
0.59
0.60
0.61
-
-
-
-
-
TW
2.96
2.70
2.79
2.90
2.78
2.90
2.84
2.93
2.84
2.75
3.00
2.70
-
-
-
-
-
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.