Department of Computer Science and Engineering
Leena Salmela
This is my old home page which is no longer maintained. You can find my new homepage here.
I am a PhD student and a researcher at Department of Computer Science and Engineering in Helsinki University of Technology. My research deals with string algorithms. More specifically I have been developing algorithms for various online string search problems, like multiple pattern matching with very large pattern sets and parameterized matching.
Contact
Mail address: Department of Computer Science and Engineering,
Helsinki University of Technology,
P.O. Box 5400, FI-02015 TKK, Finland.Street address: Computer Science Building, Room A223
Konemiehentie 2. Espoo, FinlandPhone: +358 9 451 2876 Email: lsalmela cs.hut.fi.
Areas of Interest
- String algorithms, especially various online search problems.
- Computer science education.
Research Groups
Publications
- L. Salmela, J. Tarhio and P. Kalsi: Approximate Boyer-Moore string matching for small alphabets. To appear in Algorithmica.
- G. Navarro and L. Salmela: Indexing variable length substrings for exact and approximate matching. To appear in Proc. SPIRE '09, String Processing and Information Retrieval.
- E. Rivals, L. Salmela, P. Kiiskinen, P. Kalsi and J. Tarhio: MPSCAN: fast localisation of multiple reads in genomes. To appear in Proc. WABI '09, Workshop on Algorithms in Bioinformatics.
- L. Salmela: Improved algorithms for string searching problems. Doctoral dissertation, TKK Research Reports in Computer Science and Engineering A, TKK-CSE-A1/09, Department of Computer Science and Engineering, Helsinki University of Technology, 2009.
- L. Salmela, J. Tarhio and T. Montonen: Towards automated management of compiler assignments. In: Proc. CSEDU 2009, Int. Conf. on Computer Supported Education (ed. J. Cordeiro, B. Shishkov, A. Verbraeck, and M. Helfert), Vol. 2, INSTICC, 2009, 243–249.
- F. Claude, G. Navarro, H. Peltola, L. Salmela and J. Tarhio: Speeding up pattern matching by text sampling. In: Proc SPIRE'08, String Processing and Information Retrieval (ed. A. Amir, A. Turpin, and A. Moffat), Lecture Notes in Computer Science 5280, Springer, 2008, 87–98.
- L. Salmela and J. Tarhio: Fast parameterized matching with q-grams. Journal of Discrete Algorithms, Volume 6, Issue 3, 2008, 408–419.
- L. Salmela and J. Tarhio: Algorithms for weighted matching. In: Proc SPIRE '07, String Processing and Information Retrieval (ed. N. Ziviani and R. Baeza-Yates), Lecture Notes in Computer Science 4726, Springer, 2007, 276–286.
- P. Kalsi, L. Salmela and J. Tarhio: Tuning approximate Boyer-Moore for gene sequences. In: Proc SPIRE '07, String Processing and Information Retrieval (ed. N. Ziviani and R. Baeza-Yates), Lecture Notes in Computer Science 4726, Springer, 2007, 173–183.
- L. Salmela and J. Tarhio: Sublinear algorithms for parameterized matching. In: Proc. CPM '06, Combinatorial Pattern Matching (ed. M. Lewenstein et al.), Lecture Notes in Computer Science 4009, Springer, 2006, 354–364.
- L. Salmela, J. Tarhio and J. Kytöjoki: Multi-pattern string matching with q-grams. ACM Journal of Experimental Algorithmics, Volume 11, 2006.
- L. Salmela: Automatic compiler building exercises. Master's Thesis, Laboratory of Information Processing Science, Helsinki University of Technology, 2005 (In Finnish).
- L. Salmela and J. Tarhio: ACE: Automated compiler exercises. In Proceedings of the 4th Finnish/Baltic Sea Conference on Computer Science Education, 2004, 131–135.
- J. Kytöjoki, L. Salmela and J. Tarhio: Tuning string matching for huge pattern sets. In: Proc. CPM '03, Combinatorial Pattern Matching (ed. R. Baeza-Yates et al.), Lecture Notes in Computer Science 2676, Springer, 2003, 211–224.
Teaching
This page is maintained by Leena Salmela, Email: lsalmela (at) cs.hut.fi
This page has been updated last on the 01.06.2009.
URL: http://www.cs.hut.fi/u/lsalmela/