Abstract
Real Scaled Matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scaled matching is an important problem that was originally inspired by Computer Vision.
In this paper, we present a new, more precise and realistic, definition for one dimensional real scaled matching, and an efficient algorithm for solving this problem. For a text of length n and a pattern of length m, the algorithm runs in time \(O(n\log m + \sqrt{n} m^{3/2}\sqrt{\log m})\).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amir, A., Apostolico, A., Landau, G.M., Satta, G.: Efficient text fingerprinting via Parikh mapping. J. of Discrete Algorithms 1(5-6), 409–421 (2003)
Amir, A., Butman, A., Crochemore, A., Landau, G.M., Schaps, M.: Two dimensional pattern matching with rotations. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 17–31. Springer, Heidelberg (2003)
Amir, A., Butman, A., Lewenstein, M.: Real scaled matching. Information Processing Letters 70(4), 185–190 (1999)
Amir, A., Butman, A., Lewenstein, M., Porat, E.: Real two dimensional scaled matching. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 353–364. Springer, Heidelberg (2003)
Amir, A., Calinescu, G.: Alphabet independent and dictionary scaled matching. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 320–334. Springer, Heidelberg (1996)
Amir, A., Farach, M.: Efficient 2-dimensional approximate matching of halfrectangular figures. Information and Computation 118(1), 1–11 (1995)
Amir, A., Kapah, O., Tsur, D.: Faster two dimensional pattern matching with rotations. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 409–419. Springer, Heidelberg (2004)
Amir, A., Landau, G.: Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science 81, 97–115 (1991)
Amir, A., Landau, G.M., Vishkin, U.: Efficient pattern matching with scaling. Journal of Algorithms 13(1), 2–32 (1992)
Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Comm. ACM 20, 762–772 (1977)
Didier, G., Schmidt, T., Stoye, J., Tsur, D.: Character sets of strings (2004) (submitted)
Fredriksson, K., Ukkonen, E.: A rotation invariant filter for two-dimensional string matching. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 118–125. Springer, Heidelberg (1998)
Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comp. 6, 323–350 (1977)
Krithivansan, K., Sitalakshmi, R.: Efficient two dimensional pattern matching in the presence of errors. Information Sciences 13, 169–184 (1987)
Landau, G.M., Vishkin, U.: Pattern matching in a digitized image. Algorithmica 12(3/4), 375–408 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amir, A., Butman, A., Lewenstein, M., Porat, E., Tsur, D. (2004). Efficient One Dimensional Real Scaled Matching. In: Apostolico, A., Melucci, M. (eds) String Processing and Information Retrieval. SPIRE 2004. Lecture Notes in Computer Science, vol 3246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30213-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-30213-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23210-0
Online ISBN: 978-3-540-30213-1
eBook Packages: Springer Book Archive