Abstract
Two equal-length integer-value strings jump-match if each of their corresponding (locationwise) elements differ by the same value d. In Jump matching one seeks all text substrings which jump-match the pattern. Strings approximate jump-match if all elements differ by the same value asides from at most k, where k is predefined. In approximate jump-matching one seeks the text substrings which approximate jump-match with the pattern.
We present innovative, efficient deterministic and randomized algorithms to solve the approximate jump-matching problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amir, A., Farach, M.: Efficient 2-dimensional approximate matching of half-rectangular figures. Information and Computation 118(1), 1–11 (1995)
Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. of Algorithms, 257–275 (2004)
Amir, A., Lipsky, O., Porat, E., Umanski, J.: Approximate matching in the l 1 metric. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 91–103. Springer, Heidelberg (2005)
Atallah, M.J.: Faster image template matching in the sum of the absolute value of differences measure. IEEE Transactions on Image Processing 10(4), 659–663 (2001)
Clifford, P., Clifford, R.: Self-normalised distance with don’t cares. In: CPM 2007. LNCS, vol. 4580, pp. 63–70. Springer, Heidelberg (2007)
Clifford, P., Clifford, R., Iliopoulos, C.S.: Faster algorithms for delta, gamma-matching and related problems. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 68–78. Springer, Heidelberg (2005)
Galil, Z., Giancarlo, R.: Improved string matching with k mismatches. SIGACT News 17(4), 52–54 (1986)
Indyk, P., Lewenstein, M., Lipsky, O., Porat, E.: Closest pair problems in very high dimensions. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 782–792. Springer, Heidelberg (2004)
Lipsky, O., Porat, E.: Approximate matching in the l ∞ metric. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 331–334. Springer, Heidelberg (2005)
Lemström, K., Ukkonen, E.: Including interval encoding into edit distance based music comparison and retrieval. pp. 53–60 (2000)
Landau, G.M., Vishkin, U.: Efficient string matching in the presence of errors. In: Proc. 26th IEEE FOCS, p. 126 (1985)
Mäkinen, V., Navarro, G., Ukkonen, E.: Transposition invariant string matching. J. Algorithms 56(2), 124–153 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Butman, A., Lewenstein, N., Porat, B., Porat, E. (2007). Jump-Matching with Errors. In: Ziviani, N., Baeza-Yates, R. (eds) String Processing and Information Retrieval. SPIRE 2007. Lecture Notes in Computer Science, vol 4726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75530-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-75530-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75529-6
Online ISBN: 978-3-540-75530-2
eBook Packages: Computer ScienceComputer Science (R0)