Advertisement

Efficient algorithms for approximate string matching with swaps

Extended abstract
  • Jee-Soo Lee
  • Dong Kyue Kim
  • Kunsoo Park
  • Yookun Cho
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1264)

Abstract

Most research on the edit distance problem and the k-differences problem considered the set of edit operations consisting of changes, deletions, and insertions. In this paper we include the swap operation that interchanges two adjacent characters into the set of allowable edit operations, and we present an O(t min(m,n))-time algorithm for the extended edit distance problem, where t is the edit distance between the given strings, and an O(kn)-time algorithm for the extended k-differences problem. That is, we add swaps into the set of edit operations without increasing the time complexities of previous algorithms that consider only changes, deletions, and insertions for the edit distance and k-differences problems.

Keywords

Time Algorithm Edit Distance Edit Operation Large Column Large Position 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Baeza-Yates and G. Navarro, A faster algorithm for approximate string matching, In Proc. of the 7th Symp. on Combinatorial Pattern Matching, Springer-Verlag Lecture Note in Comp. Sci. 1075 (1996), 1–23.Google Scholar
  2. 2.
    D. Eppstein, Z. Galil, R. Giancarlo, and G. Italiano, Sparse dynamic programming I: linear cost functions, J. Assoc. Comput. Mach. 39 (1992), 519–545.Google Scholar
  3. 3.
    Z. Galil and R. Giancarlo, Data structures and algorithms for approximate string matching, J. Complexity 4 (1988), 33–72.Google Scholar
  4. 4.
    Z. Galil and K. Park, An improved algorithm for approximate string matching, SIAM J. Comput. 19 (1990), 989–999.Google Scholar
  5. 5.
    S. Hannenhalli and P.A. Pevzner, Transforming men into mice (polynomial algorithm for genomic distance problem), IEEE Symp. Found. Computer Science (1995), 581–592.Google Scholar
  6. 6.
    G.M. Landau and U. Vishkin, Fast parallel and serial approximate string matching, J. Algorithms 10 (1989), 157–169.Google Scholar
  7. 7.
    R. Lowrance and R.A. Wagner, An extension of the string-to-string correction problem, J. Assoc. Comput. Mach. 22 (1975), 177–183.Google Scholar
  8. 8.
    E.W. Myers, An O(ND) difference algorithm and its variations, Algorithmica 1 (1986), 251–266.Google Scholar
  9. 9.
    D. Sankoff and J.B. Kruskal, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, New York, Addison-Wesley (1983).Google Scholar
  10. 10.
    E. Ukkonen, Algorithms for approximate string matching, Inform. and Control 64 (1985), 100–118.Google Scholar
  11. 11.
    E. Ukkonen and D. Wood, Approximate string matching with suffix automata, Algorithmica 10 (1993), 353–364.Google Scholar
  12. 12.
    R.A. Wagner, On the complexity of the extended string-to-string correction problem, ACM Symp. Theory of Computing (1975), 218–223.Google Scholar
  13. 13.
    R.A. Wagner and M.J. Fischer, The string-to-string correction problem, J. Assoc. Comput. Mach. 21 (1974), 168–173.Google Scholar
  14. 14.
    S. Wu and U. Manber, Fast text searching allowing errors, Comm. ACM 35 (1992), 83–91.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Jee-Soo Lee
    • 1
    • 2
  • Dong Kyue Kim
    • 2
  • Kunsoo Park
    • 2
  • Yookun Cho
    • 2
  1. 1.Department of Computer ScienceKorea National Open UniversitySeoulKorea
  2. 2.Department of Computer EngineeringSeoul National UniversitySeoulKorea

Personalised recommendations