Shift-or string matching with super-alphabets

Information Processing Letters

Volumn 87, Issue 4, 2003, Pages 201-204

  Fredriksson, Kimmo ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

Algorithms; Bit parallelism; String matching

Indexed keywords

ALGORITHMS; PATTERN RECOGNITION;

STRING MATCHING;

PROBLEM SOLVING;

EID: 0042170192     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00296-5     Document Type: Article

References (11)

1. Baeza-Yates R.A. Improved string searching. Software Pract. Exp. 19:(3):1989;257-271.
2. Baeza-Yates R.A., Gonnet G.H. A new approach to text searching. Comm. ACM. 35:(10):1992;74-82.
3. Boyer R.S., Moore J.S. A fast string searching algorithm. Comm. ACM. 20:(10):1977;762-772.
4. Fredriksson K. Faster string matching with super-alphabets. Proceedings of the 9th International Symposium on String Processing and Information Retrieval (SPIRE'2002). Lecture Notes in Comput. Sci. 2476:2002;44-57 Springer, Berlin.
5. Horspool R.N. Practical fast searching in strings. Software Pract. Exp. 10:(6):1980;501-506.
6. Knuth D.E., Morris J.H. Jr, Pratt V.R. Fast pattern matching in strings. SIAM J. Comput. 6:(1):1977;323-350.
7. Kytöjoki J., Salmela L., Tarhio J. Tuning string matching for huge pattern sets. Proc. CPM'03. 2003.
8. Masek W.J., Paterson M.S. A faster algorithm for computing string edit distances. J. Comput. System Sci. 20:(1):1980;18-31.
9. Navarro G., Tarhio J. Boyer-Moore string matching over ziv-lempel compressed text. Giancarlo R., Sankoff D. Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, Montréal, Canada. Lecture Notes in Comput. Sci. 1848:2000;166-180 Springer, Berlin.
10. Tarhio J., Peltola H. String matching in the DNA alphabet. Software Pract. Exp. 27:(7):1997;851-861.
11. Wu S., Manber U. Fast text searching allowing errors. Comm. ACM. 35:(10):1992;83-91.