|
Title:
|
EXPERIMENTAL RESULTS ON ALGORITHMS FOR MULTIPLE KEYWORD MATCHING |
|
Author(s):
|
Charalampos S. Kouzinopoulos, Konstantinos G. Margaritis |
|
ISBN:
|
978-972-8939-19-9 |
|
Editors:
|
Hans Weghorn, Jörg Roth and Pedro Isaías |
|
Year:
|
2010 |
|
Edition:
|
Single |
|
Keywords:
|
Algorithms, Multiple Pattern Matching, String Searching |
|
Type:
|
Short Paper |
|
First Page:
|
129 |
|
Last Page:
|
133 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Multiple keyword matching is a basic problem in computer science and is used to locate all the appearances of a finite set of keywords (the so called ``patterns'') inside an input string (the so called ``text''). This paper presents experimental results for the well known Commentz-Walter, Wu-Manber, Set Backward Oracle Matching and Salmela-Tarhio-Kytöjoki multiple keyword matching algorithms. The algorithms are compared in terms of running time for random texts using a binary alphabet and texts using the English alphabet while the experimental results are validated against the theoretical complexity. |
|
|
|
|
|
|
