Abstract
Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Work supported in part by NSF Grants CCR-86-05353 and CCR-88-14977
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Galil, Z., and Giancarlo, R. Improved string matching with k mismatches. SIGACT News 17 (1986), 52–54.
Galil, Z., and Giancarlo, R. Data structures and algorithms for approximate string matching. Journal of Complexity 4 (1988), 33–72.
Knuth, D. E., Morris, J. H., and Pratt, V. R. Fast pattern matching in strings. SIAM J. Comput. 6 (1977), 323–350.
Landau, G. M., and Vishkin, U. Fast string matching with k differences. J. Comput. System Sci. 37 (1988), 63–78.
Landau, G. M., and Vishkin, U. Fast parallel and serial approximate string matching. Journal of Algorithms 10 (1989).
Lowrance, R., and Wagner, R. A. An extension of the string-to-string correction problem. J. Assoc. Comput. Mach. 22 (1975), 177–183.
Main, M. G., and Lorentz, R. J. An O(n log n) algorithm for finding all repetitions in a string. Journal of Algorithms 5 (1984), 422–432.
Ukkonen, E. Algorithms for approximate string matching. Information and Control 64 (1985), 100–118.
Wagner, R. A., and Fischer, M. J. The string-to-string correction problem. J. Assoc. Comput. Mach. 21 (1974), 168–173.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galil, Z., Park, K. (1989). An improved algorithm for approximate string matching. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035772
Download citation
DOI: https://doi.org/10.1007/BFb0035772
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51371-1
Online ISBN: 978-3-540-46201-9
eBook Packages: Springer Book Archive