Geometric pattern matching: a performance study
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Introduction to Algorithms
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Local Similarity Based Point-Pattern Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Pattern Matching for Spatial Point Sets
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximate matching in the L∞ metric
Information Processing Letters
L1 pattern matching lower bound
Information Processing Letters
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |
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 Lp-norm of the difference vector (|p2 -p1 -(t′2-t′1)|, |p3 -p2-(t′3 -t′2)|, . . . , |pm -pm-1 -(t′m -t′m-1)|), where p1, p2, . . . , pm 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 O(mnT(p)), where T(p) is the time of evaluating xp for x ∈ R.