Software—Practice & Experience
A very fast substring search algorithm
Communications of the ACM
A new approach to text searching
Communications of the ACM
Predicting string search speed
Journal of Experimental Algorithmics (JEA)
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A fast string searching algorithm
Communications of the ACM
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Efficient Exact Pattern-Matching in Proteomic Sequences
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
GRASPm: an efficient algorithm for exact pattern-matching in genomic sequences
International Journal of Bioinformatics Research and Applications
Improving Boyer-Moore-Horspool using machine-words for comparison
Proceedings of the 48th Annual Southeast Regional Conference
Approximate string matching with reduced alphabet
Algorithms and Applications
| Hi-index | 0.00 |
In this paper, we present a new string-pattern matching algorithm that partitions the text into segments of the input pattern length and searches for pattern occurrences using a simple hashing scheme. Unlike the well known Boyer-Moore style algorithm, our algorithm does not compute variable shift length, thus providing a conceptually simpler way to search for patterns. Empirical evaluation shows that our algorithm runs significantly faster than Sunday's and Horspool's extensions of the Boyer-Moore algorithm. The notion of the non-occurrence heuristic used in our algorithm, together with a text partitioning scheme, leads to a simplified scheme for searching for pattern occurrences, thus yielding better run time performance.