Pattern Matching with Swaps

Journal of Algorithms

Volumn 37, Issue 2, 2000, Pages 247-266

  Amir, Amihood ^a   Aumann, Yonatan ^b   Landau, Gad M ^a,c   Lewenstein, Moshe ^d   Lewenstein, Noa ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c POLYTECHNIC UNIVERSITY   (United States)

^d UNIVERSITY OF HAIFA   (Israel)

Author keywords

Combinatorial algorithms on words; Design and analysis of algorithms; Nonstandard pattern matching; Pattern matching; Pattern matching with swaps

Indexed keywords

EID: 0001420479     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1120     Document Type: Article

References (23)

1. K. Abrahamson, Generalized string matching, SIAM J. Comput. 16 (1987), 1039-1051.
2. A. Amir and M. Farach, Efficient 2-dimensional approximate matching of half-rectangular figures, Inform. and Comput. 118 (1995), 1-11.
3. A. Amir, G. Landau, M. Lewenstein, and N. Lewenstein, Efficient special cases of swapped matching, Inform. Process. Lett. 68, No. 3, (1997), 125-132.
4. A. Amir, M. Lewenstein, and E. Porat, Faster string matching with k mismatches, in "Proceedings of the Eleventh Symposium on Discrete Algorithms, San Fransisco, CA," 2000, 794-803.
5. R. S. Boyer and J. S. Moore, A fast string searching algorithm, Comm. Assoc. Comput. Mach. 20 (1977), 762-772.
6. V. Chvatal, D. A. Klarner, and D. E. Knuth, "Selected Combinatorial Research Problems," Technical Report STAN-CS-72-292, Stanford University, 1972.
7. R. Cole and R. Hariharan, Approximate string matching: A faster simpler algorithm, in "Proc. 9th ACM-SIAM Symposium on Discrete Algorithm (SODA)," pp. 463-472, 1998.
8. M. J. Fischer and M. S. Paterson, String matching and other products, "Complexity of Computation" (R. M. Karp, Ed.), SIAM-AMS Proceedings, Vol. 7, pp. 113-125, 1974.
9. Z. Galil, Open problems in stringology, in "Combinatorial Algorithms on Words," (Z. Galil and A. Apostolico, Eds.), Vol. 12, pp. 1-8, Springer-Verlag, Berlin/New York.
10. Z. Galil and R. Giancarlo, Improved string matching with k mismatches, SIGACT News 17 (1986), 52-54.
11. Z. Galil and K. Park, An improved algorithm for approximate string matching, SIAM J. Comput. 19 (1990), 989-999.
12. P. Inkyk, Deterministic superimposed coding with applications to pattern matching, in "Proc. 38th IEEE FOCS," pp. 127-136, 1997.
13. H. Karloff, Fast algorithms for approximately counting mismatches, Inform. Proceess. Lett. 48, No. 2, (1993), 53-60.
14. S. Rao Kosaraju, Efficient string matching, manuscript, 1987.
15. G. M. Landau and U. Vishkin, Efficient string matching with k mismatches, Theoret. Comput. Sci. 43 (1986), 239-249.
16. G. M. Landau and U. Vishkin, Fast parallel and serial approximate string matching, J. Algorithms 10 (1989), 157-169.
17. G. M. Landau, E. W. Myers, and J. P. Schmidt, Incremental string comparison, SIAM J. Comput. 27 (1998), 557-582.
18. V. I. Levenshtein, Binary codes capable of correcting, deletions, insertions and reversals, Sovient Phys. Dokl. 10 (1966), 707-710.
19. B. Lewin, Genes for SMA: Multum in parvo, Cell 80 (1995), 1-5.
20. R. Lowrance and R. A. Wagner, An extension of the string-to-string correction problem, J. Assoc. Comput. Mc 22 (1975), 177-183.
21. S. Muthukrishnan, New results and open problems related to non-standard stringology, in "Proc. 6th Combinatorial Pattern Matching Conference," Lecture Notes in Computer Science, Vol. 937, pp. 298-317, Springer-Verlag, Berlin/New York, 1995.
22. S. Muthukrishnan, Boolean convolution reduction to swapped matching, personal communication, 1997.
23. S. Muthukrishnan and K. Palem, Non-standard stringology: Algorithms and complexity, in "Proc. 26th Annual Symposium on the Theory of Computing," pp. 770-779, 1994.