Forskningsresultat per år
Forskningsresultat per år
- 21 resultat
Sökresultat
-
2023
Computing All-vs-All MEMs in Grammar-Compressed Text
Díaz-Domínguez, D. & Salmela, L., 2023, String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Proceedings. Nardini, F. M., Pisanti, N. & Venturini, R. (red.). Cham: Springer, s. 157-170 14 s. (Lecture Notes in Computer Science; vol. 14240).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
Simple Runs-Bounded FM-Index Designs Are Fast
Díaz-Domínguez, D., Dönges, S., Puglisi, S. J. & Salmela, L., juli 2023, 21st International Symposium on Experimental Algorithms, SEA 2023. Georgiadis, L. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, s. 7:1--7:16 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 265).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
Öppen tillgångFil -
2022
Computing all-vs-all MEMs in run-length encoded collections of HiFi reads
Díaz-Domínguez, D., Puglisi, S. & Salmela, L., 2022, String Processing and Information Retrieval. SPIRE 2022. Cham: Springer, s. 198-213 (Lecture Notes in Computer Science; vol. 13617).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
Öppen tillgångFil -
2020
Fast and efficient Rmap assembly using bi-labelled de Bruijn graph
Mukherjee, K., Rossi, M., Salmela, L. & Boucher, C., 2020, 20th International Workshop on Algorithms in Bioinformatics (WABI 2020). Kingsford, C. & Pisanti, N. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 9:1-9:16 16 s. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 172).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
Öppen tillgångFil -
2019
Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding
Kiirala, N., Salmela, L. & Tomescu, A., 2019, 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019). Pisanti, N. & Pissis, S. P. (red.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 8:1-8:16 16 s. (Edit Leibniz International Proceedings in Informatics (LIPIcs); vol. 128).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
Öppen tillgångFil -
2018
Kermit: Guided Long Read Assembly using Coloured Overlap Graphs
Walve, R. M., Rastas, P. M. A. & Salmela, L. M., 2018, 18th International Workshop on Algorithms in Bioinformatics (WABI 2018). Parida, L. & Ukkonen, E. (red.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 11:1-11:11 11 s. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 113).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
Öppen tillgångFil -
2017
Disentangled long-read de Bruijn graphs via optical maps
Alipahani, B., Salmela, L., Puglisi, S. J., Muggli, M. & Boucher, C., 2017, 17th International Workshop on Algorithms in Bioinformatics, WABI 2017. Schwartz, R. & Reinert, K. (red.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 1:1-1:14 14 s. (Leibniz International Proceedings in Informatics; vol. 88).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
Öppen tillgångFil -
2016
Identification of Variant Compositions in Related Strains Without Reference
Rautiainen, M., Salmela, L. & Mäkinen, V., 2016, Algorithms for Computational Biology: Third International Conference, AlCoB 2016, Trujillo, Spain, June 21-22, 2016, Proceedings. Botón-Fernández, M., Martín-Vide, C., Santander-Jiménez, S. & Vega-Rodríguez, M. A. (red.). Springer International Publishing , s. 158-170 13 s. (Lecture Notes in Computer Science; vol. 9702).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
Öppen tillgångFil -
2015
Gap filling as exact path length problem
Salmela, L., Sahlin, K., Mäkinen, V. & Tomescu, A. I., 2015, Research in Computational Molecular Biology : 19th Annual International Conference, RECOMB 2015, Warsaw, Poland, April 12-15, 2015, Proceedings . Przytycka, T. M. (red.). Cham: Springer International Publishing AG, s. 281-292 12 s. (Lecture Notes in Bioinformatics; vol. 9029).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
2012
Forbidden Patterns
Fischer, J., Gagie, T., Kopelowitz, T., Lewenstein, M., Mäkinen, V., Salmela, L. & Välimäki, N., 2012, LATIN 2012: Theoretical Informatics: 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings. Fernández-Baca, D. (red.). Springer-Verlag, s. 327-337 (Lecture Notes in Computer Science; vol. 7256).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
Indexed Multi-Pattern Matching
Gagie, T., Karhu, K., Kärkkäinen, J., Mäkinen, V., Salmela, L. & Tarhio, J., 2012, LATIN 2012: Theoretical Informatics: 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings. Springer-Verlag, s. 399-407 10 s. (Lecture Notes in Computer Science; vol. 7256).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
2010
Bit-parallel search algorithms for long patterns
Durian, B., Peltola, H., Salmela, L. & Tarhio, J., 2010, Proceedings of the 9th International Symposium on Experimental Algorithms. Festa, P. (red.). Springer-Verlag, s. 129-140 12 s. (Lecture Notes in Computer Science; vol. 2010, nr. 6049).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
2009
Indexing variable length substrings for exact and approximate matching
Navarro, G. & Salmela, L., 2009, String Processing and Information Retrieval: 16th International Symposium, SPIRE 16th International Symposium, SPIRE 2009 Saariselkä, Finland, August 25-27, 2009. Proceedings. Karlgren, J., Tarhio, J. & Hyyrö, H. (red.). Springer, s. 214-221 8 s. (Lecture Notes in Computer Science; nr. 5721).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
MPSCAN: fast localisation of multiple reads in genomes
Rivals, E., Salmela, L., Kiiskinen, P., Kalsi, P. & Tarhio, J., 2009, Algorithms in Bioinformatics: 9th InternationalWorkshop,WABI 2009 Philadelphia, PA, USA, September 12-13, 2009 Proceedings. Salzberg, S. L. & Warnow, T. (red.). Springer, s. 246-260 15 s. (Lecture Notes in Bioinformatics; nr. 5724).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
Towards automated management of compiler assignments
Salmela, L., Tarhio, J. & Montonen, T., 2009, CSEDU 2009 - Proceedings of the 1st International Conference on Computer Supported Education. Cordeiro, J., Shishkov, B., Verbraeck, A. & Helfert, M. (red.). The Institute for Systems and Technologies of Information, Control and Communication, Vol. 2. s. 243-249 7 s.Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
2008
Speeding up pattern matching by text sampling
Claude, F., Navarro, G., Salmela, L., Peltola, H. & Tarhio, J., 2008, Proceedings of the 15th International Symposium on String Processing and Information Retrieval. Amir, A., Turpin, A. & Moffat, A. (red.). Springer, s. 87-98 12 s. (Lecture Notes in Computer Science; nr. 5280).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
2007
Algorithms for Weighted Matching
Salmela, L. & Tarhio, J., 2007, Proceedings of the 14th International Symposium on String Processing and Information Retrieval. Ziviani, N. & Baeza-Yates, R. (red.). Springer, s. 276-286 11 s. (Lecture Notes in Computer Science; nr. 4726).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
Tuning approximate Boyer-Moore for gene sequences
Kalsi, P., Salmela, L. & Tarhio, J., 2007, Proceedings of the 14th International Symposium on String Processing and Information Retrieval. Ziviani, N. & Baeza-Yates, R. (red.). Springer, s. 173-183 11 s. (Lecture Notes in Computer Science; nr. 4726).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
2006
Sublinear algorithms for parameterized matching
Salmela, L. & Tarhio, J., 2006, Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching. Lewenstein, M. & Valiente, G. (red.). Springer, s. 354-364 11 s. (Lecture Notes in Computer Science; nr. 4009).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
2004
ACE: Automated Compiler Exercises
Salmela, L. & Tarhio, J., 2004, Proceedings of the 4th Finnish/Baltic Sea Conference on Computer Science Education. Korhonen, A. & Malmi, L. (red.). s. 131-135 5 s.Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
-
2003
Tuning string matching for huge pattern sets
Kytöjoki, J., Salmela, L. & Tarhio, J., 2003, Proceedgins of the 14th Annual Symposium on Combinatorial Pattern Matching. Baeza-Yates, R., Chávez, E. & Crochemore, M. (red.). Springer, s. 211-224 14 s. (Lecture Notes in Computer Science; nr. 2676).Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review