The following pages link to Leena Salmela (Q414443):
Displaying 16 items.
- String matching with alphabet sampling (Q414445) (← links)
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
- Gap Filling as Exact Path Length Problem (Q2814587) (← links)
- Forbidden Patterns (Q2894477) (← links)
- Indexed Multi-pattern Matching (Q2894483) (← links)
- Multipattern string matching with <i>q</i> -grams (Q3507759) (← links)
- Tuning String Matching for Huge Pattern Sets (Q3550837) (← links)
- Approximate String Matching with Reduced Alphabet (Q3558273) (← links)
- (Q5088896) (← links)
- Kermit: Guided Long Read Assembly using Coloured Overlap Graphs (Q5090337) (← links)
- Disentangled Long-Read De Bruijn Graphs via Optical Maps (Q5111789) (← links)
- Sublinear Algorithms for Parameterized Matching (Q5307519) (← links)
- Fast and efficient Rmap assembly using the bi-labelled de Bruijn graph (Q6487635) (← links)
- Computing all-vs-all MEMs in grammar-compressed text (Q6545422) (← links)
