A O(log n) Signature-Based String Matching Algorithm
Samer Nofal · 2009
This paper presents a new algorithm for the string matching problem. The new technique is based on converting the string matching problem into a number searching problem. The algorithm is investigated and compared to the suffix array technique. Experiments show faster search and preprocessing time with comparable space complexity.