We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulting algorithm and show that the retrieval time is O(n ), for 0 < < 1, whenever < 1 ? e= p , where is the error level tolerated and is the alphabet size. We experimentally show that this index outperforms by far all other algorithms for indexed approximate searching, also being the rst experiments that compare the di

more »

... nt existing schemes. We nally show how this index can be implemented using much less space.