Average complexity of backward q-gram string matching algorithms

Authors:
Leena Salmela
Affiliations:
Department of Computer Science and Helsinki Institute for Information Technology, P.O. Box 68, FI-00014 University of Helsinki, Finland
Venue:
Information Processing Letters
Year:
2012

Citing 11
Cited 0

Improved string searching

Software—Practice & Experience
A fast string searching algorithm

Communications of the ACM
Fast and flexible string matching by combining bit-parallelism and suffix automata

Journal of Experimental Algorithmics (JEA)
Approximate String Matching and Local Similarity

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Average complexity of exact and approximate multiple string matching

Theoretical Computer Science
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
Improving practical exact string matching

Information Processing Letters
Bit-parallel search algorithms for long patterns

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A fast algorithm for approximate string matching on gene sequences

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.89

Visualization

Abstract

Many efficient string matching algorithms make use of q-grams and process the text in windows which are read backward. In this paper we provide a framework for analyzing the average case complexity of these algorithms taking into account the statistical dependencies between overlapping q-grams. We apply this to the q-gram Boyer-Moore-Horspool algorithm adapted to various string matching problems and show that the algorithm is optimal on average.