Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Salmela, Leena"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Average complexity of backward
q
-gram string matching algorithms
Leena Salmela
Information Processing Letters
112
(11), 2012, pp. 433-437
Fast scaffolding with small independent mixed integer programs
Leena Salmela
,
Veli Mäkinen
,
Niko Välimäki
,
Johannes Ylinen
,
Esko Ukkonen
Bioinformatics
27
(23), 2011, pp. 3259-3265
Correcting errors in short reads by multiple alignments
Leena Salmela
,
Jan Schröder
Bioinformatics
27
(11), 2011, pp. 1455-1461
Approximate Boyer-Moore string matching for small alphabets
Leena Salmela
,
Jorma Tarhio
,
Petri Kalsi
Algorithmica
58
(3), 2010, pp. 591-609
Correction of sequencing errors in a mixed set of reads
Leena Salmela
Bioinformatics
26
(10), 2010, pp. 1284-1290
Sublinear algorithms for parameterized matching
Leena Salmela
,
Jorma Tarhio
Lecture Notes in Computer Science
4009
, 2006, pp. 354-364
Tuning string matching for huge pattern sets
Jari Kytöjoki
,
Leena Salmela
,
Jorma Tarhio
Lecture Notes in Computer Science
2676
, 2003, pp. 211-224