Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
On a cyclic string-to-string correction problem
Information Processing Letters
An improved algorithm for approximate string matching
SIAM Journal on Computing
A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
Approximate string matching using within-word parallelism
Software—Practice & Experience
SIAM Journal on Computing
A fast bit-vector algorithm for approximate string matching based on dynamic programming
Journal of the ACM (JACM)
The String-to-String Correction Problem
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A Faster Algorithm for Approximate String Matching
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
A parallel algorithm for fixed-length approximate string-matching with k-mismatches
Algorithms and Applications
MoTeX: A word-based HPC tool for MoTif eXtraction
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
| Hi-index | 0.01 |
The approximate string matching problem is to find all locations which a pattern of length m matches a substring of a text of length n with at most k differences. The program agrep is a simple and practical bit-vector algorithm for this problem. In this paper we consider the following incremental version of the problem: given an appropriate encoding of a comparison between A and bB, can one compute the answer for A and B, and the answer for A and Bc with equal efficiency, where b and c are additional symbols? Here we present an elegant and veryeasy to implement bit-vector algorithm for answering these questions that requires only O(n⌈m/w⌉) time, where n is the length of A, m is the length of B and w is the number of bits in a machine word. We also present an O(nm⌈h/w⌉) algorithm for the fixed-length approximate string matching problem: given a text t, a pattern p and an integer h, compute the optimal alignment of all substrings of p of length h and a substring of t.