On the one hand, Nawab, Stevenson, and Clough (2010) apply greedy string tiling, which aims at detecting as long as possible identical fragments.
this approach clearly outperforms the rest of detectors when dealing with cases with a high density of identical fragments (c 5 in Figure 7).