Leena Salmela

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Computing all-vs-all MEMs in grammar-compressed text	2024-05-29	Paper
Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads String Processing and Information Retrieval	2023-08-04	Paper
Fast and efficient Rmap assembly using the bi-labelled de Bruijn graph	2023-02-07	Paper
scientific article; zbMATH DE number 7559176 (Why is no real title available?)	2022-07-18	Paper
Kermit: guided long read assembly using coloured overlap graphs	2022-07-18	Paper
Disentangled long-read de Bruijn graphs via optical maps	2020-05-27	Paper
Gap filling as exact path length problem Lecture Notes in Computer Science	2016-06-22	Paper
Average complexity of backward \(q\)-gram string matching algorithms Information Processing Letters	2012-07-25	Paper
Forbidden patterns LATIN 2012: Theoretical Informatics	2012-06-29	Paper
Indexed multi-pattern matching LATIN 2012: Theoretical Informatics	2012-06-29	Paper
String matching with alphabet sampling Journal of Discrete Algorithms	2012-05-11	Paper
Approximate Boyer-Moore string matching for small alphabets Algorithmica	2010-09-27	Paper
Approximate string matching with reduced alphabet Algorithms and Applications	2010-05-04	Paper
Tuning string matching for huge pattern sets Combinatorial Pattern Matching	2010-04-06	Paper
Fast parameterized matching with \(q\)-grams Journal of Discrete Algorithms	2009-05-13	Paper
Multipattern string matching with q -grams ACM Journal of Experimental Algorithmics	2008-06-20	Paper
Sublinear Algorithms for Parameterized Matching Combinatorial Pattern Matching	2007-09-14	Paper

Research outcomes over time

This page was built for person: Leena Salmela