Combinatorial Algorithms on Words
Combinatorial Algorithms on Words
Faster algorithms for δ,γ-matching and related problems
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Approximate matching in the L1 metric
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Approximate point set pattern matching with Lp-norm
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
One-dimensional approximate point set pattern matching with Lp-norm
Theoretical Computer Science
| Hi-index | 0.89 |
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 theL"~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"+"j-p"j|. We consider the Approximatek-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 @f. We show an algorithm that solves this problem in O(n(k+log(min(m,|@S|)))logm) time.