Advertisement

Approximate Periods with Levenshtein Distance

  • Martin Šimůnek
  • Bořivoj Melichar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5148)

Abstract

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.

References

  1. 1.
    Melichar, B., Holub, J., Polcar, T.: Text searching algorithms. Tutorial to the Athens Course (2005). http://www.stringology.org/athens/
  2. 2.
    Sim, J.S., Iliopoulos, C.S., Park, K., Smyth, W.F.: Approximate periods of strings. Theoretical Computer Science 262(1-2), 557–568 (2001)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Martin Šimůnek
    • 1
  • Bořivoj Melichar
    • 1
  1. 1.Department of Computer Science and EngineeringCzech Technical University in PragueCzech Republic

Personalised recommendations