Abstract
Let a text T=t 0,...,t n − − 1 and a pattern P=p 0,..., p m − − 1, strings of natural numbers, be given. In the Approximate Matching in the L ∞ metric problem the output is, for every text location i, the L ∞ distance between the pattern and the length m substring of the text starting at i, i.e. Max \(_{j=0}^{m--1}\)|t \(_{i+{\it j}}\)–p j |. We consider the Approximate k –L ∞ distance problem. Given text T and pattern P as before, and a natural number k the output of the problem is the L ∞ distance of the pattern from the text only at locations i in the text where the distance is bounded by k. For the locations where the distance exceeds k the output is φ. We show an algorithm that solves this problem in O(n(k + log(min(m, |Σ|)))logm) time.
Partially supported by GIF Young Scientists Program grant 2055-1168.6/2002.
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., Lipsky, O., Porat, E., Umanski, J.: Approximate matching in the l1 metric. In: Apostolico, et al. (eds.) [2], pp. 91–103 (2005)
Apostolico, A., Crochemore, M., Park, K. (eds.): CPM 2005. LNCS, vol. 3537. Springer, Heidelberg (2005)
Apostolico, A., Galil, Z. (eds.): Combinatorial Algorithms on Words. Springer, New York (1985)
Clifford, P., Clifford, R., Iliopoulos, C.S.: Faster algorithms for delta, gamma-matching and related problems. In: Apostolico, A., et al. (eds.) [2], pp. 68–78 (2005)
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)
Indyk, P., Lipsky, O., Porat, E.: Approximate translation matching (2004) (manuscript)
Lipsky, O.: Efficient distance computations. Master’s thesis, Bar-Ilan University, Department of Computer Science (2003)
Lipsky, O., Porat, E.: Approximate l ∞ matching. Technical report, Department of Computer Science (2003)
Shmulevich, I., Yli-Harja, O., Coyle, E., Povel, D., Lemstrom, K.: Perceptual issues in music pattern recognition - complexity of rhythm and key fining (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lipsky, O., Porat, E. (2005). Approximate Matching in the L ∞ Metric. In: Consens, M., Navarro, G. (eds) String Processing and Information Retrieval. SPIRE 2005. Lecture Notes in Computer Science, vol 3772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575832_37
Download citation
DOI: https://doi.org/10.1007/11575832_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29740-6
Online ISBN: 978-3-540-32241-2
eBook Packages: Computer ScienceComputer Science (R0)