Part of the Lecture Notes in Computer Science book series (LNCS, volume 5148)
Approximate Periods with Levenshtein Distance
We present a new algorithm deciding for strings t and w whether w is an approximate generator of t with Levenshtein distance at most k. The algorithm is based on finite state transducers.
- 1.Melichar, B., Holub, J., Polcar, T.: Text searching algorithms. Tutorial to the Athens Course (2005). http://www.stringology.org/athens/
© Springer-Verlag Berlin Heidelberg 2008