SPIRE 2007: String Processing and Information Retrieval pp 98-106 | Cite as
Jump-Matching with Errors
Conference paper
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.
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)MATHCrossRefMathSciNetGoogle Scholar
- Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. of Algorithms, 257–275 (2004)Google Scholar
- 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)Google Scholar
- 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)MATHCrossRefMathSciNetGoogle Scholar
- Clifford, P., Clifford, R.: Self-normalised distance with don’t cares. In: CPM 2007. LNCS, vol. 4580, pp. 63–70. Springer, Heidelberg (2007)Google Scholar
- 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)Google Scholar
- Galil, Z., Giancarlo, R.: Improved string matching with k mismatches. SIGACT News 17(4), 52–54 (1986)CrossRefGoogle Scholar
- 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)Google Scholar
- 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)CrossRefGoogle Scholar
- Lemström, K., Ukkonen, E.: Including interval encoding into edit distance based music comparison and retrieval. pp. 53–60 (2000)Google Scholar
- Landau, G.M., Vishkin, U.: Efficient string matching in the presence of errors. In: Proc. 26th IEEE FOCS, p. 126 (1985)Google Scholar
- Mäkinen, V., Navarro, G., Ukkonen, E.: Transposition invariant string matching. J. Algorithms 56(2), 124–153 (2005)MATHCrossRefMathSciNetGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2007