Abstract
Given two sets of points, the text and the pattern, determining whether the pattern “appears” in the text is modeled as the point set pattern matching problem. Applications usually ask for not only exact matches between these two sets, but also approximate matches. In this paper, we investigate a one-dimensional approximate point set matching problem proposed in [T. Suga and S. Shimozono, Approximate point set pattern matching on sequences and planes, CPM’04]. What requested is an optimal match which minimizes the L p -norm of the difference vector (|p 2 − p 1 − (t′2 − t′1)|, |p 3 − p 2 − (t′3 − t′2)|, …, |p m − p m − 1 − (t′ m − t′ m − 1)|), where p 1, p 2, …, p m is the pattern and t′1, t′2, …, t′ m is a subsequence of the text. For p → ∞, the proposed algorithm is of time complexity O(mn), where m and n denote the lengths of the pattern and the text, respectively. For arbitrary p < ∞, the time complexity is O(mnT(p)), where T(p) is the time of evaluating x p for x ∈ R.
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
Aggarwal, A., Klawe, M.M., Moran, S., Shor, P., Wilber, R.: Geometric applications of a matrix-searching algorithm. Algorithmica 2, 195–208 (1987)
Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88–94. Springer, Heidelberg (2000)
Cardoze, D.E., Schulman, L.J.: Pattern matching for spatial point sets. In: FOCS 1998, pp. 156–165 (1998)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Intorduction to Algorithms, 2nd edn. MIT Press, Cambridge
de Rezende, P.J., Lee, D.T.: Point set pattern matching in d-dimensions. Algorithmica 13, 387–404 (1995)
Fischer, J., Heun, V.: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 459–470. Springer, Heidelberg (2007)
Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Communications of the ACM 18, 341–343 (1975)
Lipsky, O., Porat, E.: Approximate matching in the L ∞ metric. Information Processing Letters 105, 138–140 (2008)
Lipsky, O., Porat, E.: L 1 pattern matching lower bound. Information Processing Letters 105, 141–143 (2008)
Lipsky, O., Porat, E.: Approximate pattern matching with the L 1, L 2, and L ∞ metrics. Algorithmica 55, 212–223 (2009)
Mäkinen, V.: Using edit distance in point-patter matching. In: SPIRE 2001, pp. 153–161 (2001)
Mäkinen, V., Ukkonen, E.: Local similarity based point-pattern matching. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 115–132. Springer, Heidelberg (2002)
Mäkinen, V.: Parameterized approximate string matching and local-similarity-based point-pattern matching. Department of Computer Science, University of Helsinki, Report A-2003-6 (August 2003)
Suga, T., Shimozono, S.: Approximate point set pattern matching on sequences and planes. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 89–101. Springer, Heidelberg (2004)
Gavrilov, M., Indyk, P., Motwani, R., Venkatasubramanian, S.: Geometric pattern matching: A performance study. In: SoCG 1999, pp. 79–85 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, HL., Chen, KY. (2011). Approximate Point Set Pattern Matching with L p -Norm. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds) String Processing and Information Retrieval. SPIRE 2011. Lecture Notes in Computer Science, vol 7024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24583-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-24583-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24582-4
Online ISBN: 978-3-642-24583-1
eBook Packages: Computer ScienceComputer Science (R0)