Fast string matching with mismatches

Information and Computation

Volumn 108, Issue 2, 1994, Pages 187-199

  Baeza Yates, Ricardo A ^a   Gonnet, Gaston H ^b  

^a Depto de Ciencia de la Computati?n PUC Chile   (Chile)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344868092     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1994.1007     Document Type: Article

References (15)

1. Abrahamson, K. (1987), Generalized string matching, SIAM J. Comput. 16, 1039-1051.
2. Boyer, R., and Moore, S. (1977), A fast string searching algorithm. Comm. ACM 20, 762-772.
3. Brzozowski, J. (1964), Derivatives of regular expressions, J. Assoc. Comput. Much. 11, 481-494.
4. Baeza-Yates, R. A. (1989a), Improved string searching, Software-Practice Experience 19 (3), 257-271.
5. Baeza-Yates, R. A. (1989b), "Efficient Text Searching," Ph.D. Thesis, Dept. of Computer Science, University of Waterloo; also as Research Report CS-89-17.
6. Baeza-Yates, R. A. (1989c), String searching algorithm revisited, in "Workshop in Algorithms and Data Structures, August 1989" (F. Dehne, J.-R. Sack, and N. Santoro, Eds.), pp. 75-96, Lecture Notes on Computer Science, Vol. 382, Springer-Verlag, Berlin/New York.
7. Baeza-Yates, R. A., and Gonnet, G. H. (1989), A new approach to text searching, in "Proceedings of 12th ACM SIGIR, Cambridge, June 1989," pp. 168-175.
8. Baeza-Yates, R. A., and Gonnet, G. H. also in Comm. ACM 35, 74-82, 1992.
9. Gonnet, G. H., and Baeza-Yates, R. (1991), "Handbook of Algorithms and Data Structures—In Pascal and C," 2nd ed. Addison-Wesley
10. Wokingham, W., Galil, Z., and Giancarlo, R. (1986), Improved string matching with k mismatches, SIGACT News 17, 52-54.
11. Grossi, R., and Luccio, F. (1989), Simple and efficient string matching with k mismatches, Inform. Process. Lett. 33 (3), 113-120.
12. Knuth, D. E., Morris, J., and Pratt, V. (1977), Fast pattern matching in strings, SIAM J. Comput. 6, 323-350.
13. Landau G., and Vishkin, U. (1986), Efficient string matching with k mismatches, Theoret. Comput. Sci. 43, 239-249.
14. Smit, G. V. (1982), A comparison of three matching algorithms. Software—Practice Experience 12. 57-66.
15. Tarhio J., and Ukkonen, E. (1990), Boyer-Moore approach to approximate string matching, in "2nd Scandinavian Workshop in Algorithmic Theory, SWAT'90, Bergen, Norway" (J. R. Gilbert and R. G. Karlsson, Eds.), pp. 348-359, Lecture Notes in Computer Science, Vol. 447, Springer, Berlin, New York.