The greedy algorithm for edit distance with moves

Information Processing Letters

Volumn 97, Issue 1, 2006, Pages 23-27

  Kaplan, Haim ^a   Shafrir, Nira ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Analysis of algorithms; Approximation algorithms; Edit distance with moves; Greedy algorithm; String matching

Indexed keywords

APPROXIMATION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

ANALYSIS OF ALGORITHMS; APPROXIMATION ALGORITHMS; EDIT DISTANCE WITH MOVES; GREEDY ALGORITHMS; STRING MATCHING;

ALGORITHMS;

EID: 27844530215     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.08.010     Document Type: Article

References (8)

1. P. Kolman, A. Goldstein, J. Zheng, Minimum common string partition problem: Hardness and approximations, in: Proc. 15th Internat. Symp. (ISAAC), 2004, pp. 473-484
2. G. Cormode, and S. Muthukrishnan The string edit distance matching problem with moves Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms 2002 Society for Industrial and Applied Mathematics 667 676
3. D. Gusfield Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology 1997 Cambridge Univ. Press Cambridge
4. D. Lopresti, and A. Tomkins Block edit models for approximate string matching Theoret. Comput. Sci. 181 1 1997 159 179
5. M. Chrobak, P. Kolman, J. Sgall, A greedy algorithm for the minimum common string partition problem, in: Proc. 7th Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2004, pp. 84-95
6. S. Muthukrishnan, and S.C. Sahinalp Approximate nearest neighbors and sequence comparison with block operations Proc. 32nd Annual ACM Symp. on Theory of Computing 2000 ACM Press New York 416 424
7. D. Shapira, and J.A. Storer Edit distance with move operations Proc. 13th Annual Symp. on Combinatorial Pattern Matching 2002 Springer-Verlag Berlin 85 98
8. W.F. Tichy The string-to-string correction problem with block moves ACM Trans. Comput. Syst. 2 4 1984 309 321