Fast exact string matching algorithms

Information Processing Letters

Volumn 102, Issue 6, 2007, Pages 229-235

  Lecroq, Thierry ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

Design of algorithms; Hashing; String matching

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; WORD PROCESSING;

DESIGN OF ALGORITHMS; HASHING; STRING MATCHING;

PATTERN MATCHING;

EID: 34147159284     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.01.002     Document Type: Article

References (13)

1. Allauzen C., Crochemore, and Raffinot M. Factor oracle: A new structure for pattern matching. In: Pavelka J., Tel G., and Bartosek M. (Eds). Proceedings of SOFSEM'99, Theory and Practice of Informatics. Milovy, Czech Republic, 1999. Lecture Notes in Computer Science vol. 1725 (1999), Springer-Verlag, Berlin 291-306
2. Cantone D., and Faro S. Fast-search: A new efficient variant of the Boyer-Moore string matching algorithm. In: Jansen K., Margraf M., Mastrolilli M., and Rolim J.D.P. (Eds). Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms. Ascona, Switzerland, 2003. Lecture Notes in Computer Science vol. 2647 (2003), Springer-Verlag, Berlin 47-58
3. Charras C., and Lecroq T. Handbook of Exact String Matching Algorithms (2004), King's College London Publications
4. M. Crochemore, T. Lecroq, A fast implementation of the Boyer-Moore string matching algorithm, submitted for publication
5. Fredriksson K., and Grabowski S. Practical and optimal string matching. Proceedings of SPIRE'2005. Lecture Notes in Computer Science vol. 3772 (2005), Springer-Verlag, Berlin 374-385
6. Holub J., and Durian B. Fast variants of bit parallel approach to suffix automata. Talk given in: The Second Haifa Annual International Stringology Research Workshop of the Israeli Science Foundation (2005). http://www.cri.haifa.ac.il/events/2005/string/presentations/Holub.pdf
7. Hume A., and Sunday D.M. Fast string searching. Software-Practice & Experience 21 11 (1991) 1221-1248
8. Karp R.M., and Rabin M.O. Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31 2 (1987) 249-260
9. Navarro G., and Raffinot M. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithms 5 (2000) 4
10. Navarro G., and Raffinot M. Flexible Pattern Matching in Strings-Practical On-Line Search Algorithms for Texts and Biological Sequences (2002), Cambridge University Press
11. Sheik S.S., Aggarwal S.K., Poddar A., Balakrishnan N., and Sekar K. A fast pattern matching algorithm. J. Chem. Inf. Comput. Sci. 44 (2004) 1251-1256
12. S. Wu, U. Manber, A fast algorithm for multi-pattern searching, Report TR-94-17, Department of Computer Science, University of Arizona, Tucson, AZ, 1994
13. Zhu R.F., and Takaoka T. On improving the average case of the Boyer-Moore string matching algorithm. J. Inform. Process. 10 3 (1987) 173-177