Fast-search: A new efficient variant of the Boyer-Moore string matching algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2647, Issue , 2003, Pages 47-58

  Cantone, Domenico ^a   Faro, Simone ^a  

^a UNIVERSITY OF CATANIA   (Italy)

Author keywords

Experimental algorithms; String matching; Text processing

Indexed keywords

STRING SEARCHING ALGORITHMS; TEXT PROCESSING;

BOYER-MOORE; EXPERIMENTAL ALGORITHMS; FAST SEARCH; PRACTICAL USE; REVERSE FACTORS; STRING MATCHING; TIME EFFICIENCIES;

ALGORITHMS;

EID: 35248880584     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44867-5_4     Document Type: Article

References (9)

1. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977.
2. R. A. Baeza-Yates and M. Régnier. Average running time of the Boyer-Moore-Horspool algorithm. Theor. Comput. Sci., 92(1):19-31, 1992.
3. M. Crochemore, A. Czumaj, L. Ga̧sieniec, S. Jarominek, T. Lecroq, W. Plandowski, and W. Rytter. Speeding up two string matching algorithms. Algorithmica, 12(4/5):247-267, 1994.
4. L. J. Guibas and A. M. Odiyzko. A new proof of the linearity of the Boyer-Moore string searching algorithm. SIAM J. Comput., 9(4):672-682, 1980.
5. R. N. Horspool. Practical fast searching in strings. Softw. Pract. Exp., 10(6):501-506, 1980.
6. A. Hume and D. M. Sunday. Fast string searching. Softw. Pract. Exp., 21(11):1221-1248, 1991.
7. T. Lecroq. New experimental results on exact string-matching. Rapport LIFAR 2000.03, Université de Rouen, France, 2000.
8. D. M. Sunday. A very fast substring search algorithm. Commun. ACM, 33(8):132-142, 1990.
9. A. C. Yao. The complexity of pattern matching for a random string. SIAM J. Comput., 8(3):368-387, 1979.