143 citations · 251 across the 8 of their papers we have counts for
8 papers
Accurate selfcorrection of errors in long reads using de Bruijn graphs
Leena Salmela, Riku Walve, Eric Rivals +1
New long read sequencing technologies, like PacBio SMRT and Oxford NanoPore, can produce sequencing reads up to 50,000 bp long but with an error rate of at least 15%. Reducing the…
Longest common substrings with k mismatches
Tomas Flouri, Emanuele Giaquinta, Kassian Kobert +1
The longest common substring with -mismatches problem is to find, given two strings and , a longest substring of and of such that the Hamming…
Mining the VVV: star formation and embedded clusters
Otto Solin, Lauri Haikala, Esko Ukkonen
The aim of this study is to locate previously unknown stellar clusters from the VISTA variables in the Vía Láctea Survey (VVV) catalogue data. The method, fitting a mixture model o…
Motif matching using gapped patterns
Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski +2
We present new algorithms for the problem of multiple string matching of gapped patterns, where a gapped pattern is a sequence of strings such that there is a gap of fixed length b…
Mining the UKIDSS GPS: star formation and embedded clusters
O. Solin, E. Ukkonen, L. Haikala
Data mining techniques must be developed and applied to analyse the large public data bases containing hundreds to thousands of millions entries. The aim of this study is to develo…
On the complexity of finding gapped motifs
Morris Michael, Francois Nicolas, Esko Ukkonen
This paper has been withdrawn by the corresponding author because the newest version is now published in Journal of Discrete Algorithms.