Fast text searching: allowing errors
Communications of the ACM
Approximate string matching using within-word parallelism
Software—Practice & Experience
A fast bit-vector algorithm for approximate string matching based on dynamic programming
Journal of the ACM (JACM)
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Fast bit-vector algorithms for approximate string matching under indel distance
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
Information Processing Letters
| Hi-index | 0.00 |
The task of approximate string matching is to find all locations at which a pattern string p of length m matches a substring of a text string t of length n with at most k differences. It is common to use Levenshtein distance [5], which allows the differences to be single-character insertions, deletions, substitutions. Recently, in [3], the IndelMYE, IndelWM and IndelBYN algorithms where introduced as modified version of the bit-parallel algorithms of Myers [6], Wu&Manber [10] and Baeza-Yates&Navarro [1], respectively. These modified versions where made to support the indel distance (only single-character insertions and/or deletions are allowed). In this paper we present an improved version of IndelMYE that makes a better use of the bit-operations and runs 24.5 percent faster in practice. In the end we present a complete set of experimental results to support our findings.