Advertisement

A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations

  • Pritom Ahmed
  • A. S. M. Shohidull Islam
  • M. Sohel Rahman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7643)

Abstract

In this paper, we visit the problem of approximate string matching allowing for translocations. We study the graph theoretic model proposed by [5] and extending the model, devise an efficient algorithm to solve the approximate string matching allowing for translocations. The resulting algorithm is an adaptation of the classic shift-and algorithm. For patterns having length similar to the word-size of the target machine, the algorithm runs in O(n + mk 2) time for fixed length translocation where n, m and k are the length of the text, pattern and the translocation respectively.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74–82 (1992)CrossRefGoogle Scholar
  2. 2.
    Cantone, D., Faro, S., Giaquinta, E.: Approximate string matching allowing for inversions and translocations. In: Holub, J., Žďárek, J. (eds.), pp. 37–51 (2010)Google Scholar
  3. 3.
    Charras, C., Lecroq, T.: Handbook of Exact String Matching Algorithms. College Publications (2004)Google Scholar
  4. 4.
    Damerau, F.: A technique for computer detection and correction of spelling errors. Commun. ACM 7(3), 171–176 (1964)CrossRefGoogle Scholar
  5. 5.
    Iliopoulos, C.S., Rahman, M.S.: A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 316–327. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Levenshtein, V.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady 10, 707 (1966)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Pritom Ahmed
    • 1
  • A. S. M. Shohidull Islam
    • 1
  • M. Sohel Rahman
    • 1
  1. 1.AℓEDA Group, Department of CSEBUETDhakaBangladesh

Personalised recommendations