Leena Salmela
Post-doctoral researcher
Department of Computer Science
P. O. Box 68
(Gustaf Hällströmin katu 2 b)
FIN-00014 University
of Helsinki, FINLAND
Email: Firstname.Lastname@cs.Helsinki.FI
Room: B230
Research Interests
- String algorithms
- Computational biology
Publications
Recent publications- L. Salmela: Average complexity of backward q-gram string
matching algorithms. Information Processing Letters, Volume 112,
Issue 11, 2012, 433–437.
- L. Salmela, V. Mäkinen, N. Välimäki, J. Ylinen, and E. Ukkonen: Fast
scaffolding with small independent mixed integer programs.
Bioinformatics, Volume 27, Issue 23, 2011, 3259–3265.
- L. Salmela and J. Schröder: Correcting errors in short reads by
multiple alignments. Bioinformatics, Volume 27, Issue 11, 2011,
1455–1461. (Also in HiTSeq 2011).
- L. Salmela: Merkkijonoalgoritmeja monen hahmon hakuun.
Tietojenkäsittelytiede 31, 2010, 70–83.
- F. Claude, G. Navarro, H. Peltola, L. Salmela and J. Tarhio:
String matching with alphabet sampling. Journal of Discrete
Algorithms, Volume 11, 2012, 37–50.
- L. Salmela: Correction of sequencing errors in a mixed set of
reads. Bioinformatics, Volume 26, Issue 10, 2010, 1284–1290.
(Award for best paper submitted to HiTSeq 2010).
- L. Salmela, J. Tarhio and P. Kalsi: Approximate Boyer-Moore
string matching for small alphabets. Algorithmica, Volume 58, Issue
3, 2010, 591–609.