A very fast string matching algorithm for small alphabets and long patterns

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

Volumn 1448 LNCS, Issue , 1998, Pages 55-64

  Charras, Christian ^a   Lecro, Thierry ^a   Pehoushek, Joseph Daniel ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

AVERAGE CASE; FAST STRING MATCHING; STRING MATCHING; TEXT SYMBOLS;

STRING SEARCHING ALGORITHMS;

EID: 84877327256     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030780     Document Type: Conference Paper

References (10)

1. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Comm. ACM, 20(10):762-772, 1977.
2. M. Crochemore, A. Czumaj, L. Gãsieniec, S. Jarominek, T. Lecroq, W. Plandowski, and W. Rytter. Speeding up two string matching algorithms. Algorithmica, 12(4/5):247-267, 1994.
3. M. Crochemore and W. Rytter. Text algorithms. Oxford University Press, 1994.
4. A. Hume and D. M. Sunday. Fast string searching. Software-Practice & J Experience, 21(11):1221-1248, 1991.
5. D. E. Knuth, J. H. Morris, Jr, and V. R. Pratt. Fast pattern matching in strings. SIAM J. Comput., 6(1):323-350, 1977.
6. T. Lecroq. A variation on the Boyer-Moore algorithm. Theoret. Comput. Sci., 92(1):119-144, 1992.
7. T. Lecroq. Experiments on string matching in memory structures. Software-Practice 8J Experience, 28(5):562-568, 1998.
8. J. H. Morris, Jr and V. R. Pratt. A linear pattern-matching algorithm. Report 40, University of California, Berkeley, 1970.
9. T. Raita. Tuning the Boyer-Moore-Horspool string searching algorithm. Software-Practice & Experience, 22(10):879-884, 1992.
10. G. A. Stephen. String searching algorithms. World Scientific Press, 1994.