Algorithms for approximate string matching
Information and Control
Fast parallel and serial approximate string matching
Journal of Algorithms
An improved algorithm for approximate string matching
SIAM Journal on Computing
Fast text searching: allowing errors
Communications of the ACM
Approximate Boyer-Moore string matching
SIAM Journal on Computing
Text algorithms
A fast bit-vector algorithm for approximate string matching based on dynamic programming
Journal of the ACM (JACM)
Very fast and simple approximate string matching
Information Processing Letters
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Fast and flexible string matching by combining bit-parallelism and suffix automata
Journal of Experimental Algorithmics (JEA)
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Text-Retrieval: Theory and Practice
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
A Unified View to String Matching Algorithms
SOFSEM '96 Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Theoretical and Empirical Comparisons of Approximate String Matching Algorithms
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Approximate String Matching and Local Similarity
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
On Using q-Gram Locations in Approximate String Matching
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
A bit-vector algorithm for computing Levenshtein and Damerau edit distances
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Average-optimal single and multiple approximate string matching
Journal of Experimental Algorithmics (JEA)
Proceedings of the 14th International Conference on Parallel Architectures and Compilation Techniques
Increased bit-parallelism for approximate and multiple string matching
Journal of Experimental Algorithmics (JEA)
Efficient generation of super condensed neighborhoods
Journal of Discrete Algorithms
Average-optimal multiple approximate string matching
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
On bit-parallel processing of multi-byte text
AIRS'04 Proceedings of the 2004 international conference on Asian Information Retrieval Technology
Approximate regional sequence matching for genomic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one [Myers, J. of the ACM, 1999], searches for a pattern of length m in a text of length n permitting k differences in O(mn/w) time, where w is the width of the computer word. The second one [Navarro and Raffinot, ACM JEA, 2000], extends a sublinear-time exact algorithm to approximate searching. The latter technique makes use of an O(kmn/w) time algorithm [Wu and Manber, Comm. ACM, 1992] for its internal workings. This algorithm is slow but flexible enough to support all the required operations. In this paper we show that the faster algorithm of Myers can be adapted to support all those operations. This involves extending it to compute edit distance, to search for any pattern suffix, and to detect in advance the impossibility of a later match. The result is an algorithm that performs better than the original version of Navarro and Raffinot and that is the fastest for several combinations of m, k and alphabet sizes that are useful, for example, in natural language searching and computational biology.