Fig. 1

Synthetic datasets, with \(\sigma =2\) and \(k=\lfloor m/(2\log m)\rfloor \) according to Theorem 1. Running time for computing pairwise distances by finding lower and higher bounds in the SA, and by processing LCP based clusters, as function of the input size \(n=dm\)