Premium
Experimental results on string matching algorithms
Author(s) -
Lecroq Thierry
Publication year - 1995
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380250703
Subject(s) - string searching algorithm , commentz walter algorithm , computer science , algorithm , string (physics) , character (mathematics) , approximate string matching , running time , matching (statistics) , pattern matching , boyer–moore string search algorithm , efficient algorithm , theoretical computer science , mathematics , artificial intelligence , statistics , mathematical physics , geometry
We present experimental results for string matching algorithms which are known to be fast in practice. We compare these algorithms through two aspects: the number of text character inspections and the running time. These experiments show that for large alphabets and small patterns the Quick Search algorithm of Sunday is the most efficient and that for small alphabets and large patterns it is the Reverse Factor algorithm of Crochemore et al. which is the most efficient.