String Searching Algorithms : Improvements and Experimental Results
Fast string searching algorithms play an important role in many application areas. In this paper the published algorithms are surveyed, considerable improvements are developed and a detailed experimental comparison of the alqorithms is presented. Some of the improvements as well as some of the results of the measurements are quite surprising, among these that algorithms for multiple-words at-a-time search cannot compete with repeatedly applied one-word at-a-time alqorithms in practical situations. As a conclusion we present concise criteria for the selection of the approriate algorithm for a given application.
Nutzung und Vervielfältigung:
Alle Rechte vorbehalten