SIAM Journal on Computing
Efficient 2-dimensional approximate matching of half-rectangular figures
Information and Computation
A fast string searching algorithm
Communications of the ACM
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Numerical Recipes in C: The Art of Scientific Computing
Numerical Recipes in C: The Art of Scientific Computing
Introduction to Algorithms
Information and Computation
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Handbook of Exact String Matching Algorithms
Handbook of Exact String Matching Algorithms
Average case analysis of the Boyer-Moore algorithm
Random Structures & Algorithms
Swap and mismatch edit distance
Algorithmica
Finding the position of the k-mismatch and approximate tandem repeats
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Approximate matching in weighted sequences
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Faster algorithms for δ,γ-matching and related problems
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Quasi-distinct Parsing and Optimal Compression Methods
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Quasi-distinct parsing and optimal compression methods
Theoretical Computer Science
European Journal of Combinatorics
| Hi-index | 0.00 |
Convolutions have proven to be an effective tool in asymptotically efficient pattern matching algorithms. This study attempts to find the type of problems where convolutions are inefficient in practice, and give possible solutions for the complex cases where the convolution method does not seem to aid realistic sized inputs.