Approximate string matching with reduced alphabet

Authors:
Leena Salmela;Jorma Tarhio
Affiliations:
Department of Computer Science, University of Helsinki;Department of Computer Science and Engineering, Aalto University
Venue:
Algorithms and Applications
Year:
2010

Citing 23
Cited 0

Algorithms for approximate string matching

Information and Control
A technique for two-dimensional pattern matching

Communications of the ACM - Special issue: multiprocessing
Approximate string-matching with q-grams and maximal matches

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Approximate Boyer-Moore string matching

SIAM Journal on Computing
A sublinear algorithm for two-dimensional string matching

Pattern Recognition Letters
Fast and practical approximate string matching

Information Processing Letters
A comparison of approximate string matching algorithms

Software—Practice & Experience
Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time

SIAM Journal on Computing
A new string-pattern matching algorithm using partitioning and hashing efficiently

Journal of Experimental Algorithmics (JEA)
A fast string searching algorithm

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Approximate String-Matching over Suffix Trees

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Approximate Multiple Strings Search

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Shift-or string matching with super-alphabets

Information Processing Letters
Approximate string matching on Ziv-Lempel compressed text

Journal of Discrete Algorithms
Efficient randomized pattern-matching algorithms

IBM Journal of Research and Development - Mathematics and computing
Average-optimal single and multiple approximate string matching

Journal of Experimental Algorithmics (JEA)
Multipattern string matching with q-grams

Journal of Experimental Algorithmics (JEA)
Fast exact string matching algorithms

Information Processing Letters
Fast parameterized matching with q-grams

Journal of Discrete Algorithms
A fast algorithm for approximate string matching on gene sequences

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Practical and optimal string matching

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned version of the approximate Boyer–Moore algorithm utilizing the Four-Russians technique. Our experiments show that the alphabet reduction makes the algorithm faster. Especially in the k-mismatch case, the new variation is faster than earlier algorithms for English data with small values of k.