SIAM Journal on Computing
Efficient 2-dimensional approximate matching of half-rectangular figures
Information and Computation
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial Algorithms on Words
Combinatorial Algorithms on Words
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings (Lecture Notes in Computer Science)
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
Approximated Pattern Matching with the L1 , L2 and L∞ Metrics
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
| Hi-index | 0.00 |
Let a text string T = t0,...,tn−−1 and a pattern string P = p0,..., pm−−1ti, pj∈IN be given. In The Approximate Pattern Matching in the L1metric problem (L1-matching for short) the output is, for every text location i, the L1 distance between the pattern and the length m substring of the text starting at i, i.e. Σ$_{j=0}^{m-1}|{\it t}_{i+{\it j}}$ – pj | . The Less Than Matching problem is that of finding all locations i of T where t$_{i+{\it j}}$ ≥ pjj = 0,..., m–1 . The String Matching with Mismatches problem is that of finding the number of mismatches between the pattern and every length m substring of the text. For the three above problems, the fastest known deterministic solution is $O(n\sqrt{m{\rm log}m})$ time. In this paper we show that the latter two problems can be linearly reduced to the problem of L1-matching.