A very fast substring search algorithm
Communications of the ACM
A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
Faster algorithms for string matching with k mismatches
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
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)
NR-grep: a fast and flexible pattern-matching tool
Software—Practice & Experience
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
A String Matching Algorithm Fast on the Average
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Approximate String Matching and Local Similarity
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
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)
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
Theoretical Computer Science
Algorithms on Strings
Bit-parallel string matching under Hamming distance in O(n⌈m/w⌉) worst case time
Information Processing Letters
A new model to solve the swap matching problem and efficient algorithms for short patterns
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Practical and optimal string matching
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
From nondeterministic suffix automaton to lazy suffix tree
Algorithms and Applications
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
| Hi-index | 0.00 |
The exact string matching problem is to find the occurrences of a pattern of length m from a text of length n symbols. We develop a novel and unorthodox filtering technique for this problem. Our method is based on transforming the problem into multiple matching of carefully chosen pattern subsequences. While this is seemingly more difficult than the original problem, we show that the idea leads to very simple algorithms that are optimal on average. We then show how our basic method can be used to solve multiple string matching as well as several approximate matching problems in average optimal time. The general method can be applied to many existing string matching algorithms. Our experimental results show that the algorithms perform very well in practice.