Improved string matching with k mismatches
ACM SIGACT News
Efficient string matching with k mismatches
Theoretical Computer Science
SIAM Journal on Computing
Data structures and algorithms for approximate string matching
Journal of Complexity
A new approach to text searching
Communications of the ACM
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Faster algorithms for string matching with k mismatches
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On AC0 implementations of fusion trees and atomic heaps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Faster Algorithms for String Matching Problems: Matching the Convolution Bound
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Combinatorial power in multimedia processors
ACM SIGARCH Computer Architecture News
Bit-parallel string matching under Hamming distance in O(n⌈m/w⌉) worst case time
Information Processing Letters
Finding large 3-free sets I: The small n case
Journal of Computer and System Sciences
The Practical Efficiency of Convolutions in Pattern Matching Algorithms
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Faster pattern matching with character classes using prime number encoding
Journal of Computer and System Sciences
Fast Convolutions and Their Applications in Approximate String Matching
Combinatorial Algorithms
An improved construction of progression-free sets
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete 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 pattern matching with k-mismatches in packed text
Information Processing Letters
Hi-index | 0.00 |
We develop a method for performing convolutions efficiently in a word RAM model of computation, having a word size of w=@W(logn) bits, where n is the input size. The basic idea is to pack several elements of the input vector into a single computer word, effectively enabling parallel computation of convolutions. The technique is applied to approximate string matching under Hamming distance. The obtained algorithms are the fastest known. In particular, we reduce the complexity of the Amir et al. (2000) algorithm for k-mismatches from O(nklogk) to O(n+nk/wlogk). Those algorithms impose some (not severe) limitation on the pattern length, m. We present another, less efficient however, technique based on word-level parallelism, which works without the pattern length limitation.