On-line string matching algorithms: survey and experimental results

References

• Apostolico , A. and Giancarlo , R. 1986 . The Boyer–Moore–Galil string searching strategies revisited . SIAM Journal on Computing , 15 ( 1 ) : 98 – 105 .
   Web of Science ®Google Scholar
• Aho , A.V. Algorithms for finding patterns in strings , Vol. 5 , 255 – 300 . Amsterdam : Elsevier Science Publishers . Handbook of Theoretical Computer Science
   Google Scholar
• Boyer , R.S. and Moore , J.S. 1977 . A fast string searching algorithm . Communications of the ACM , 20 ( 10 ) : 762 – 772 .
   Web of Science ®Google Scholar
• Baeza-Yates , R. 1989 . Algorithms for string searching: A survey . ACM SIGIR Forum , 23 ( 3 – 4 ) : 34 – 58 .
   Google Scholar
• Baeza-Yates , R. . Text Retrieval: Theory and Practice . Proc. of the 12th IFIP World Computer Congress . Madrid, Spain. pp. 465 – 476 . North-Holland .
   Google Scholar
• Baeza-Yates , R. and Gonnet , G.H. 1992 . A new approach to text searching . Communications of the ACM , 35 ( 10 ) : 74 – 82 .
   Web of Science ®Google Scholar
• Crochemore , M. , Czumaj , A. , Gasieniec , L. , Jarominek , S. , Lecroq , T. , Plandowski , W. and Rytter , W. 1994 . Speeding Up Two String Matching Algorithms . Algorithmica , 12 ( 4 – 5 ) : 247 – 267 .
   Google Scholar
• Colussi , L. 1991 . Correctness and efficiency of the pattern matching algorithms . Information and Computation , 95 ( 2 ) : 225 – 251 .
   Web of Science ®Google Scholar
• Colussi , L. 1994 . Fastest pattern matching in strings . Journal of Algorithms , 16 ( 2 ) : 163 – 189 .
   Google Scholar
• Crochemore , M. and Rytter , W. 1994 . Text Algorithms , Oxford University Press .
   Google Scholar
• Davies , G. and Bowsher , S. 1986 . Algorithms for pattern matching . Software-Practice and Experience , 16 ( 6 ) : 575 – 601 .
   Web of Science ®Google Scholar
• Galil , Z. 1979 . On improving the worst case running time of the Boyer-Moore string searching algorithm . Communications of the ACM , 22 ( 9 ) : 505 – 508 .
   Web of Science ®Google Scholar
• Gonnet , G.H. and Baeza-Yates , R. 1991 . Handbook of Algorithms and Data Structures in Pascal and C , 251 – 288 . Workingham : Addison-Wesley .
   Google Scholar
• Hancart , C. 1993 . On Simon's string searching algorithm . Information Processing Letters , 47 ( 2 ) : 95 – 99 .
   Web of Science ®Google Scholar
• Harrison , M.C. 1971 . Implementation of the substring test by hashing . Communications of the ACM , 14 ( 12 ) : 777 – 779 .
   Google Scholar
• Horspool , R.N. 1980 . Practical fast searching in strings . Software-Practice and Experience , 10 ( 6 ) : 501 – 506 .
   Web of Science ®Google Scholar
• Hume , A. and Sunday , D. 1991 . Fast string searching . Software-Practice and Experience , 21 ( 11 ) : 1221 – 1248 .
   Web of Science ®Google Scholar
• Knuth , D.E. , Morris , J.H. and Pratt , V.R. 1977 . Fast pattern matching in strings . SIAM Journal on Computing , 6 ( 2 ) : 323 – 350 .
   Google Scholar
• Kernighan , B.W. and Ritchie , D.M. 1988 . The C Programming Language , Englewood Cliffs, NJ : Prentice Hall .
   Google Scholar
• Liu , Z. , Du , X. and Ishii , N. 1998 . An improved adaptive string searching algorithm . Software-Practice and Experience , 28 ( 2 ) : 191 – 198 .
   Web of Science ®Google Scholar
• Lecroq , T. 1992 . A variation on the Boyer-Moore algorithm . Theoretical Computer Science , 92 ( 1 ) : 119 – 144 .
   Web of Science ®Google Scholar
• Lecroq , T. 1995 . Experimental results on string matching algorithms . Software-Practice and Experience , 25 ( 7 ) : 727 – 765 .
   Web of Science ®Google Scholar
• Manolopoulos , Y. and Faloutsos , C. 1996 . Experimenting with pattern matching algorithms . Information Sciences , 90 ( 1 – 4 ) : 75 – 89 .
   Google Scholar
• Michailidis , P. and Margaritis , K. 1999 . String Matching Algorithms , Greek : University of Macedonia . Technical Report, Department of Ap, Informatics
   Google Scholar
• Navarro , G. and Raffinot , M. . A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching . Proc. of the 9th Annual Symposium on Combinatorial Pattern Matching . Vol. 1448 , Berlin : Springer-Verlag .
   Google Scholar
• Raita , T. 1992 . Tunning the Boyer– Moore – Horspool string searching algorithm . Software-Practice and Experience , 22 ( 10 ) : 879 – 884 .
   Web of Science ®Google Scholar
• Smit , G. and De , V. 1982 . A Comparison of Three String Matching Algorithms . Software-Practice and Experience , 12 ( 1 ) : 57 – 66 .
   Web of Science ®Google Scholar
• Smith , P. 1991 . Experiments with a very fast substring search algorithm . Software-Practice and Experience , 21 ( 10 ) : 1065 – 1074 .
   Web of Science ®Google Scholar
• Stephen , A.G. 1994 . String Searching Algorithms , World Scientific Press .
   Google Scholar
• Sunday , D. 1990 . A very fast substring search algorithm . Communications of the ACM , 33 ( 8 ) : 132 – 142 .
   Web of Science ®Google Scholar
• Wu , S. and Manber , U. 1992 . Fast text searching allowing errors . Communications of the ACM , 35 ( 10 ) : 83 – 91 .
   Web of Science ®Google Scholar