Swap and mismatch edit distance

Algorithmica (New York)

Volumn 45, Issue 1, 2006, Pages 109-120

  Amir, Amihood ^a,b   Eisenberg, Estrella ^a   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b Georgia Institute of Technology   (United States)

Author keywords

Approximate pattern matching; Edit distance; Hamming distance; Swap matching

Indexed keywords

ALGORITHMS; MATHEMATICAL OPERATORS; NUMERICAL ANALYSIS; PROBLEM SOLVING;

APPROXIMATE PATTERN MATCHING; EDIT DISTANCE; HAMMING DISTANCE; SWAP MATCHING;

APPROXIMATION THEORY;

EID: 33646424680     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-005-1192-8     Document Type: Article

References (14)

1. K. Abrahamson, Generalized string matching, SIAM Journal on Computing, 16(6):1039-1051, 1987.
2. A. Amir, R. Cole, R. Hariharan, M. Lewenstein, and E. Porat. Overlap matching. Information and Computation, 181(1):57-74, 2003.
3. A. Amir, M. Lewenstein, and E. Porat. Faster algorithms for string matching with k mismatches. In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 794-803, 2000.
4. A. Amir, M. Lewenstein, and E. Porat. Approximate swapped matching. Information Processing Letters, 83(1):33-39, 2002.
5. R. Cole and R. Hariharan. Approximate string matching: a taster simpler algorithm. In Proc. 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 463-4-72, 1998.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms, MIT Press, Cambridge, MA, and McGraw-Hill. New York, 1992.
7. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, Oxford, 1994.
8. M. J. Fischer and M. S. Paterson. String matching and other products. In Complexity of Computation. (R. M. Karp, editor), pages 113-125. SIAM-AMS Proceedings, Volume 7. American Mathematical Society, Providence, RI, 1974.
9. G. M. Landau and U. Vishkin. Efficient string matching with k mismatches. Theoretical Computer Science. 43:239-249, 1986.
10. G. M. Landau and U. Vishkin. Fast parallel and serial approximate string matching. Journal of Algorithms. 10(2):157-169, 1989.
11. V. I. Levenshtein. Binary codes capable of correcting, deletions, insertions and reversals. Soviet Physics Doklady, 10:707-710, 1966.
12. R. Lowrance and R. A. Wagner. An extension of the string-to-string correction problem. Journal of the ACM, 22(2):177-183, 1975.
13. R.A.Wagner. On the complexity of the extended string-to-string correction problem. In Proc. 7th ACM STOC. pages 218-223, 1975.
14. P. Weiner. Linear pattern matching algorithm. Proc. 14 IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.