| Indexing methods for approximate string matching G Navarro, RA Baeza-Yates, E Sutinen, J Tarhio IEEE Data Eng. Bull. 24 (4), 19-27, 2001 | 339 | 2001 |
| Modernit oppimisympäristöt-Tietotekniikan käyttö opetuksen ja oppimisen tukena V Meisalo, E Sutinen, J Tarhio Tietosanoma, 2000 | 252 | 2000 |
| On using q-gram locations in approximate string matching E Sutinen, J Tarhio European Symposium on Algorithms, 327-340, 1995 | 196 | 1995 |
| A comparison of approximate string matching algorithms P Jokinen, J Tarhio, E Ukkonen Software: Practice and Experience 26 (12), 1439-1458, 1996 | 195 | 1996 |
| A greedy approximation algorithm for constructing shortest common superstrings J Tarhio, E Ukkonen Theoretical computer science 57 (1), 131-145, 1988 | 193 | 1988 |
| Approximate boyer–moore string matching J Tarhio, E Ukkonen SIAM Journal on Computing 22 (2), 243-260, 1993 | 160 | 1993 |
| Animation of user algorithms on the Web J Haajanen, M Pesonius, E Sutinen, J Tarhio, T Terasvirta, P Vanninen Proceedings. 1997 IEEE Symposium on Visual Languages (Cat. No. 97TB100180 …, 1997 | 149 | 1997 |
| Multipattern string matching with q-grams L Salmela, J Tarhio, J Kytöjoki Journal of Experimental Algorithmics (JEA) 11, 1.1-es, 2007 | 121 | 2007 |
| Filtration with q-samples in approximate string matching E Sutinen, J Tarhio Annual Symposium on Combinatorial Pattern Matching, 50-63, 1996 | 115 | 1996 |
| Resources, tools, and techniques for problem based learning in computing A Ellis, L Carswell, A Bernat, D Deveaux, P Frison, V Meisalo, J Meyer, ... ACM SIGCUE Outlook 26 (4), 41-56, 1998 | 112 | 1998 |
| Alternative algorithms for bit-parallel string matching H Peltola, J Tarhio International Symposium on String Processing and Information Retrieval, 80-93, 2003 | 106 | 2003 |
| Indexing Text with Approximate q-Grams G Navarro, E Sutinen, J Tanninen, J Tarhio Annual Symposium on Combinatorial Pattern Matching, 350-363, 2000 | 92 | 2000 |
| Algorithms for some string matching problems artising in molecular genetics H Peltola Proc. 2nd IFIP Congress, 53-64, 1983 | 89 | 1983 |
| Searching monophonic patterns within polyphonic sources K Lemström, J Tarhio Proceedings of the RIAO Conference 2, 1261-1278, 2000 | 86 | 2000 |
| Boyer—Moore string matching over ziv-lempel compressed text G Navarro, J Tarhio Annual Symposium on Combinatorial Pattern Matching, 166-180, 2000 | 76 | 2000 |
| Tuning BNDM with q-grams B Ďurian, J Holub, H Peltola, J Tarhio Workshop on Algorithm Engineering and Experiments (ALENEX), 29-37, 2009 | 60 | 2009 |
| Boyer-Moore approach to approximate string matching J Tarhio, E Ukkonen Scandinavian Workshop on Algorithm Theory, 348-359, 1990 | 57 | 1990 |
| Comparison of exact string matching algorithms for biological sequences P Kalsi, H Peltola, J Tarhio International Conference on Bioinformatics Research and Development, 417-426, 2008 | 54 | 2008 |
| Improving practical exact string matching B Ďurian, J Holub, H Peltola, J Tarhio Information Processing Letters 110 (4), 148-152, 2010 | 50 | 2010 |
| LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text G Navarro, J Tarhio Software: Practice and Experience 35 (12), 1107-1130, 2005 | 50 | 2005 |
Leena SalmelaUniversity of Helsinki在 cs.helsinki.fi 的电子邮件经过验证
