Rodrigo de Castro Miranda,  Maurício Ayala-Rincón. 

Landau and Vishkin developed an O(kn) algorithm for the approximate string matching problem, where k is the maximum number of admissible errors and n the length of the text. This algorithm uses suffix trees for an O(1) running time computation of the longest common extensions between strings. We present a variation of this algorithm which uses suffix arrays for computing the longest common extensions.

http://www.lbd.dcc.ufmg.br/colecoes/bsb/2005/030.pdf

Processando consulta.