Title :
A O(log n) Signature-Based String Matching Algorithm
Author_Institution :
German-Jordanian Univ., Amman
Abstract :
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.
Keywords :
computational complexity; search problems; string matching; number searching problem; signature-based string matching algorithm; space complexity; string matching problem; suffix array technique; Information technology; Network address translation; Text processing; algorithms; string matching; string searching; text processing;
Conference_Titel :
Information Technology: New Generations, 2009. ITNG '09. Sixth International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-4244-3770-2
Electronic_ISBN :
978-0-7695-3596-8
DOI :
10.1109/ITNG.2009.59
