Analysis of two-dimensional approximate pattern matching algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1075, Issue , 1996, Pages 335-347

  Park, Kunsoo ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

HAMMING DISTANCE; PATTERN MATCHING;

APPROXIMATE PATTERN MATCHING; EXPECTED TIME; INDEPENDENCE ASSUMPTION; RANDOM INPUT; SPACE COMPLEXITY; UNDESIRABLE FACTORS;

ALGORITHMS;

EID: 84957630137     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_24     Document Type: Conference Paper

References (12)

1. A.V Aho and M.J Corasick, Efficient string matching: An aid to bibliographic search, Comm. ACM 18 (1975), 333-340.
2. A. Amir and M. Farach, Efficient 2-dimensional approximate matching of nonrectangular figures, Proc. 2nd ACM-SIAM Syrup. Discrete Algorithms, 1991, 212-223.
3. A. Amir and G.M. Landau, Fast parallel and serial multidimensional approximate array matching, Theoret. Comput. Sci. 81 (1991), 97-115.
4. W.I. Chang and E.L. Lawler, Approximate string matching in sublinear expected time, Proc. 31st IEEE Syrup. Found. Computer Science, 1990, 116-124.
5. Z. Galil and R. Giancarlo, Data structure and algorithms for approximate string matching, J. Complexity 4 (1988), 33-72.
6. Z. Galil and K. Park, An improved algorithm for approximate string matching, SIAM J. Comput. 19 (1990), 989-999.
7. J. Käkkäinen and E. Ukkonen, Two and higher dimensional pattern matching in optimal expected time, Proc. ACM-SIAM Syrup. Discrete Algorithms, 1994, 715-723o
8. D.E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973.
9. K. Krithivasan and R. Sitalakshmi, Efficient two-dimensional pattern matching in the presence of errors, Information Sciences 43 (1987), 169-184.
10. G.M. Landau and U. Vishkin, Efficient string matching in the presence of errors, Proc. 26th IEEE Syrup. Found. Computer Science, 1985, 126-136.
11. S. Ranka and T. Heywood, Two-dimensional pattern matching with k mismatches, Pattern Recognition 24, 1 (1991), 31-40.
12. S.M. Ross, A First Course in Probability, 4th ed., Macmillan, 1994.