Practical and optimal string matching

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

Volumn 3772 LNCS, Issue , 2005, Pages 376-387

  Fredriksson, Kimmo ^a   Grabowski, Szymon ^b  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

^b LODZ UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; ENCODING (SYMBOLS); OPTIMAL CONTROL SYSTEMS;

COMPUTER WORD; OPTIMAL STRING MATCHING; SHIFT-OR ALGORITHMS;

PATTERN MATCHING;

EID: 33646732437     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_42     Document Type: Conference Paper

References (17)

1. R. A. Baeza-Yates and G. H. Gonnet, A new approach to text searching, Commun. ACM, 35(10):74-82, 1992.
2. R. S. Boyer and J. S. Moore. A fast string searching algorithm, Commun. ACM, 20(10):762-772, 1977.
3. M. Crochemore, C. Iliopoulos, G. Navarro, Y. Pinzon, and A. Salinger. Bitparallel (δ,γ)-matching suffix automata. Journal of Discrete Algorithms (JDA), 3(2-4):198-214, 2005.
4. M. Crochemore and W. Rytter. Text algorithms. Oxford University Press, 1994.
5. L. He and B. Fang. Linear nondeterministic dawg string matching algorithm. In Proceedings of the 11th International Symposium on String Processing and Information Retrieval (SPIRE'2004), LNCS 3246, pages 70-71. Springer-Verlag, 2004.
6. J. Holub and B. Durian. 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. R. N. Horspool. Practical fast searching in strings. Softw. Pract. Exp., 10(6):501-506, 1980.
8. D. E. Knuth, J. H. Morris, Jr, and V. R. Pratt. Fast pattern matching in strings. SIAM J. Comput., 6(1):323-350, 1977.
9. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
10. G. Navarro. NR-grep: a fast and flexible pattern matching tool. Softw. Pract. Exp., 31:1265-1312, 2001.
11. G. Navarro and M. Raffinot. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA), 5(4), 2000. http://www.jea.acm.org/2000/NavarroString.
12. H. Peltola and J. Tarhio. Alternative algorithms for bit-parallel string matching. In Proceedings of the 10th International Symposium on String Processing and Information Retrieval (SPIRE2003), LNCS 2857, pages 80-94. Springer-Verlag, 2003.
13. D. M. Sunday. A very fast substring search algorithm. Commun. ACM, 33(8):132-142, 1990.
14. E. Sutinen and J. Tarhio. On using q-gram locations in approximate string matching. In P. G. Spirakis, editor, Proceedings 3rd Annual European Symposium, number 979 in Lecture Notes in Computer Science, pages 327-340, Corfu, Greece, 1995. Springer-Verlag, Berlin.
15. T. Takaoka. Approximate pattern matching with samples, In Ding-Zhu Du and Xiang sun Zhang, editors, Proceedings of the 5th International Symposium on Algorithms and Computation, number 834 in Lecture Notes in Computer Science, pages 236-242, Beijing, P.R. China, 1994, Springer-Verlag, Berlin.
16. S. Wu and U. Manber. Fast text searching allowing errors. Commun. ACM, 35(10):83-91, 1992.
17. A. C. Yao. The complexity of pattern matching for a random string. SIAM J. Comput., 8(3):368-387, 1979.