Abstract
We simplify in this paper the algorithm by Chang and Lawler for the approximate string matching problem, by adopting the concept of sampling. We have a more general analysis of expected time with the simplified algorithm for the one-dimensional case under a non-uniform probability distribution, and we show that our method can easily be generalized to the two-dimensional approximate pattern matching problem with sublinear expected time.
Partially supported by Grant-in-aid No. 06249201 by Monbusho Scientific Research Program and a research grant from Hitachi Engineering Co., Ltd.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Amir, A., Landau, G. M.: Fast parallel and serial multidimensional approximate array matching. Theor. Comput. Sci. 81 (1991) 97–115
Baeza-Yates, R. A., Perleberg, C. H.: Fast and practical approximate string matching. Proc. 3rd Ann. Symp. on Combinatorial Pattern Matching (1992) 185–192
Baker, T. P.: A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comput. 7 (1978) 533–541
Bird, R. S.: Two dimensional pattern matching. Info. Proc. Lett. 6 (1977) 168–170
Boyer, R. S., Moore, J. S.: A fast string searching algorithm. CACM 20 (1977), 767–772
Chang, W. I., Lawler,E. L.: Approximate string matching in sublinear expected time. FOCS 31 (1990) 116–124
Erickson, B. W., Sellers, P. H.: Recognition of patterns in genetic sequences, in Sankoff and Kruskal (eds.), Time warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, 55–91 (1983)
Galil, Z., Park, K.: An improved algorithm for approximate string matching. ICALP 89, LNCS 372 (1989) 394–404
Galil, Z., Park, K.: Truly alphabet-independent two-dimensional pattern matching. FOCS 33 (1992) 247–256
Karp, R. M., Rabin, M. O.: Efficient randomized pattern-matching algorithms. IBM J. of Res. and Dev. 31 (1987) 249–260
Knuth, D. E., Morris, J. H., Pratt, V. R.: Fast pattern matching in strings. SIAM J. Comput. 6 (1977) 323–350
Landau, G. M., Vishkin, U.: Efficient string matching with k mismatches. Theor. Comput. Sci. (1985) 239–249
Landau, G. M., Vishkin, U. Fast string matching with k differences. JCSS 37 (1988) 63–78
Ukkonen, E.: Algorithms for approximate string matching. Information and Control 64 (1985) 100–118
Ukkonen, E.: Finding approximate patterns in strings. J. Algorithms 6 (1985) 132–137
Vishkin, U.: Deterministic sampling—A new technique for fast pattern matching. STOC 22 (1990) 170–180
Wu, S., Manber, U.: Fast text searching with errors. Tech. Rep. TR-91-11, Dept. of Comp. Sci., Univ. of Arizona (1991)
Zhu, R. F., Takaoka, T.: A technique for two-dimensional pattern matching. CACM 32 (1989) 1110–1120
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takaoka, T. (1994). Approximate pattern matching with samples. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_186
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_186
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive