Table 6. Running times for the pattern matching algorithm for q = 12 and different v.

v	No. neighbors	No. neighbors found	Avg. running time (s)	v-neighbors/s
0	1	246 000	0.82	300 000
1	37	2 347 258	4.2	560 000
2	631	28 288 787	43	660 000
3	6571	281 685 270	360	780 000
4	46 666	1 988 512 822	2200	900 000

For each choice of v, the following is reported: the potential number of v-neighbors for each q-gram (computed using equation 1), the number of v-neighbors present in the dataset, the average running time after subtraction of the average time needed to construct the database (19.53 s), the number of v-neighbors found per second.