Efficient special cases of Pattern Matching with Swaps

Information Processing Letters

Volumn 68, Issue 3, 1998, Pages 125-132

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

^a BAR ILAN UNIVERSITY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

^c POLYTECHNIC UNIVERSITY   (United States)

^d Georgia Institute of Technology   (United States)

Author keywords

Analysis of algorithms; Approximate pattern matching; Combinatorial algorithms on words; Design of algorithms; Generalized pattern matching; Pattern matching; Pattern Matching with Swaps

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL LINGUISTICS; PROBLEM SOLVING; SET THEORY;

APPROXIMATE PATTERN MATCHING; GENERALIZED PATTERN MATCHING;

PATTERN MATCHING;

EID: 0032203635     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00151-3     Document Type: Article

References (15)

1. K. Abrahamson, Generalized string matching, SIAM J. Comput. 16 (6) (1987) 1039-1051.
2. A. Amir, Y. Aumann, G. Landau, M. Lewenstein, N. Lewenstein, Pattern matching with swaps, in: Proc. 38th IEEE FOCS, 1997, pp. 144-153.
3. A. Amir, M. Farach, Efficient 2-dimensional approximate matching of half-rectangular figures, Inform. and Comput. 118 (1) (1995) 1-11.
4. R.S. Boyer, J.S. Moore, A fast string searching algorithm, Comm. ACM 20 (1977) 762-772.
5. M.J. Fischer, M.S. Paterson, String matching and other products, in: R.M. Karp (Ed.), Complexity of Computation, SIAM-AMS Proc. 7 (1974) 113-125.
6. K. Hashiguchi, K. Yamada, Two recognizable string-matching problems over free partially commutative monoids, Theoret. Comput. Sci. 92 (1) (1992) 77-86.
7. R. Karp, R. Miller, A. Rosenberg, Rapid identification of repeated patterns in strings, arrays and trees, in: Proc. 4th Annual Symp. Theory Comput., 1972, pp. 125-136.
8. D.E. Knuth, J.H. Morris, V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977) 323-350.
9. S. Rao Kosaraju, Efficient string matching, Manuscript, 1987.
10. V.I. Levenshtein, Binary codes capable of correcting, deletions, insertions and reversals, Soviet Phys. Dokl. 10 (1966) 707-710.
11. R. Lowrance, R.A. Wagner, An extension of the string-to-string correction problem, J. ACM (1975) 177-183.
12. S. Muthukrishnan, H. Ramesh, String matching under a general matching relation, Inform. and Comput. 122 (1) (1995) 140-148.
13. A. Pentland, Invited talk, NSF Institutional Infrastructure Workshop, 1992.
14. R.Y. Pinter, Efficient string matching with don't care patterns, in: Z. Galil, A. Apostolico (Eds.), Combinatorial Algorithms on Words, Vol. 12, NATO ASI Series F, Springer, Berlin, 1985, pp. 11-29.
15. P. Weiner, Linear pattern matching algorithm, in: Proc. 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1-11.