Leena Salmela

Available identifiers

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	2023-08-04	Paper
Fast and efficient Rmap assembly using the bi-labelled de Bruijn graph	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5088896	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	2016-06-22	Paper
Average complexity of backward \(q\)-gram string matching algorithms	2012-07-25	Paper
Forbidden Patterns	2012-06-29	Paper
Indexed Multi-pattern Matching	2012-06-29	Paper
String matching with alphabet sampling	2012-05-11	Paper
Approximate Boyer-Moore string matching for small alphabets	2010-09-27	Paper
Approximate String Matching with Reduced Alphabet	2010-05-04	Paper
Tuning String Matching for Huge Pattern Sets	2010-04-06	Paper
Fast parameterized matching with \(q\)-grams	2009-05-13	Paper
Multipattern string matching with q -grams	2008-06-20	Paper
Sublinear Algorithms for Parameterized Matching	2007-09-14	Paper

This page was built for person: Leena Salmela