Name
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 pattern matching problem proposed in [19]. We generalize the measure between approximate matches from L"1-norm to L"p-norm. More specifically, 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-~, we propose an O(mn)-time algorithm, where m and n denote the lengths of the pattern and the text, respectively. For arbitrary p |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.tcs.2013.11.022 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
One-dimensional approximate point set,exact match,approximate match,one-dimensional approximate point set,optimal match,difference vector,time algorithm,n denote,arbitrary p,point set pattern | Journal | 521, |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hung-Lung Wang | 1 | 27 | 5.63 |
| Kuan-Yu Chen | 2 | 450 | 55.78 |