Department of Informatics, Aristotle University, Thessaloniki, Greece 54006
Department of Computer Science, University of Maryland, College Park, Maryland 20742, USA
Abstract:
Two new pattern-matching algorithms based on the Boyer-Moore algorithm are presented. Their performance is compared to that of earlier relevant variants in terms of the number of character comparisons and the required running time by exhaustive simulation. Experimental results show the efficiency of both these two new algorithms.