Scaled and permuted string matching

Information Processing Letters

Volumn 92, Issue 6, 2004, Pages 293-297

  Butman, Ayelet ^a   Eres, Revital ^b   Landau, Gad M ^b,c  

^a HOLON INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

^c POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Algorithms; Approximate string matching; Permutations; Scalings

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; PROBLEM SOLVING; TEXT PROCESSING;

APPROXIMATE STRING MATCHING; PERMUTATIONS; REAL NUMBERS; SCALINGS;

PATTERN MATCHING;

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

References (15)

1. A. Amir, A. Butman, M. Crocehmore, G.M. Landau, M. Schaps, Two-dimensional pattern matching with rotations, Theoret. Comput. Sci. 314 (1-2) (2004) 173-187.
2. A. Amir, A. Butman, M. Lewenstein, Real scaled matching, Inform. Process. Lett. 70 (4) (1999) 185-190.
3. A. Amir, O. Kapah, D. Tsur, Faster two dimensional pattern matching with rotations, in: Proc. 15th Annual Symposium on Combinatorial Pattern Matching (CPM 2004), in: Lecture Notes in Comput. Sci., vol. 3109, Springer, Berlin, 2004.
4. A. Amir, G.M. Landau, U. Vishkin, Efficient pattern matching with scaling, J. Algorithms 13 (1) (1992) 2-32.
5. A. Apostolico, Z. Galil (Eds.), Pattern Matching Algorithms, Oxford University Press, 1997.
6. R.S. Boyer, J.S. Moore, A fast string searching algorithm, Comm. ACM 20 (1977) 762-772.
7. M. Crochemore, W. Rytter, Text Algorithms, Oxford University Press, 1994.
8. T. Eilam-Tsoreff, U. Vishkin, Matching patterns in strings subject to multilinear transformations, Theoret. Comput. Sci. 60 (3) (1988) 231-254.
9. K. Fredriksson, G. Navarro, E. Ukkonen, Optimal exact and fast approximate two dimensional pattern matching allowing rotations, in: Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), in: Lecture Notes in Comput. Sci., vol. 2373, Springer, Berlin, 2002, pp. 235-248.
10. K. Fredriksson, E. Ukkonen, A rotation invariant filter for two-dimensional string matching, in: Proc. 9th Annual Symposium on Combinatorial Pattern Matching (CPM 1998), in: Lecture Notes in Comput. Sci., vol. 1448, Springer, Berlin, 1998, pp. 118-125.
11. D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, 1997.
12. D.S. Hirshberg, Algorithms for the longest common subsequence problem, J. ACM. 24 (4) (1977) 664-675.
13. R. Karp, M.O. Rabin, Efficient randomized pattern-matching algorithms, IBM J. Res. Dev. (1987) 249-260.
14. D.E. Knuth, J.H. Morris, V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977) 323-350.
15. V.I. Levenshtein, Binary codes capable of correcting, deletions, insertions and reversals, Soviet Phys. Dokl. 10 (1966) 707-710.