Improved string matching with k mismatches
ACM SIGACT News
Efficient 2-dimensional approximate matching of half-rectangular figures
Information and Computation
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Efficient string matching in the presence of errors
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Transposition invariant string matching
Journal of Algorithms
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
Approximate matching in the L∞ metric
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Faster image template matching in the sum of the absolute value of differences measure
IEEE Transactions on Image Processing
Self-normalised distance with don't cares
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
The sBook: towards social and personalized learning experiences
BooksOnline '10 Proceedings of the third workshop on Research advances in large digital book repositories and complementary media
| Hi-index | 0.00 |
Two equal-length integer-value strings jump-match if each of their corresponding (locationwise) elements differ by the same value d. In Jump matching one seeks all text substrings which jump-match the pattern. Strings approximate jump-match if all elements differ by the same value asides from at mostk, where k is predefined. In approximate jump-matching one seeks the text substrings which approximate jump-match with the pattern. We present innovative, efficient deterministic and randomized algorithms to solve the approximate jump-matching problem.