Title :
A comparison of the performance of four exact string matching algorithms
Author :
Leidig, Jonathan ; Trefftz, Christian
Author_Institution :
Grand Valley State Univ., Allendale
Abstract :
There are numerous exact string matching algorithms that have similar performance characteristics. Which algorithm is best depends on the length of the pattern being searched for, the number of letters in the alphabet and the particular architecture where the program is being executed. Results of experiments on different recent microprocessors, with different word lengths are reported.
Keywords :
natural language processing; string matching; alphabet; exact string matching algorithm; word lengths; Application software; Bills of materials; Computer Society; Computer architecture; Computer science; Guidelines; Information systems; Linux; Microprocessors; Workstations;
Conference_Titel :
Electro/Information Technology, 2007 IEEE International Conference on
Conference_Location :
Chicago, IL
Print_ISBN :
978-1-4244-0941-9
Electronic_ISBN :
978-1-4244-0941-9
DOI :
10.1109/EIT.2007.4374455
