Om du gjort några ändringar i Pure kommer de visas här snart.

Publikationer 2000 2019

2006

Position-restricted substring searching

Mäkinen, V. & Navarro, G., 2006, LATIN 2006: THEORETICAL INFORMATICS. s. 703-714 12 s. (Lecture Notes in Computer Science; vol. 3887).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

2005

A simple alphabet-independent FM-index

Grabowski, S., Mäkinen, V., Navarro, G. & Salinger, A., 2005, Proceedings of the Prague Stringology Conference (PSC 2005). Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, s. 231-245

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Flexible music retrieval in sublinear time

Fredriksson, K., Mäkinen, V. & Navarro, G., 2005, Proceedings of the Prague Stringology Conference (PSC 2005). Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, s. 174-189

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Maximum Line-Pair Stabbing Problem and its Variations

Böcker, S. & Mäkinen, V., 2005, Proceedings of the 21st European Workshop on Computational Geometry. s. 183–186 4 s.

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

On minimizing pattern splitting in multi-track string matching

Lemström, K. & Mäkinen, V., 2005, I : Journal of Discrete Algorithms. 3, 2-4, s. 248-266 19 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Practical Implementation of Rank and Select Queries

González, R., Grabowski, S., Mäkinen, V. & Navarro, G., 2005, Poster Proceedings of 4th International Workshop on Efficient and Experimental Algorithms .

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskaplig

Succinct suffix arrays based on run-length encoding

Mäkinen, V. & Navarro, G., 2005, I : Nordic Journal of Computing. 12, 1, s. 44-66 23 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Succinct Suffix Arrays Based on Run-Length Encoding

Mäkinen, V. & Navarro, G., 2005, Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005). Springer-Verlag, s. 45-56 (LNCS; vol. 3537).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Transposition invariant string matching

Mäkinen, V., Navarro, G. & Ukkonen, E., 2005, I : Journal of Algorithms. 56, s. 124-153 30 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

2004

Advantages of Backward Searching: Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays

Mäkinen, V., Navarro, G. & Sadakane, K., 2004, Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC 2004). Springer-Verlag, s. 681-692 (LNCS; vol. 3341).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

An Alphabet-Friendly FM-Index

Ferragina, P., Manzini, G., Mäkinen, V. & Navarro, G., 2004, Proceedings of the 11th International Conference on String Processing and Information Retrieval (SPIRE 2004). Springer-Verlag, s. 150-160 (LNCS; vol. 3246).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Compressed Compact Suffix Arrays

Mäkinen, V. & Navarro, G., 2004, Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM 2004). Springer-Verlag, s. 420-433 (LNCS; vol. 3109).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Finding Missing Patterns

Inenaga, S., Kivioja, T. & Mäkinen, V., 2004, Proceedings of the 4th International Workshop on Algorithms in Bioinformatics (WABI 2004). Springer-Verlag, s. 463-474 (LNCS; vol. 3240).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-index

Grabowski, S., Mäkinen, V. & Navarro, G., 2004, Proceedings of the 11th International Conference on String Processing and Information Retrieval (SPIRE 2004). Springer-Verlag, s. 210-211 (LNCS; vol. 3246).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Rotation and Lighting Invariant Template Matching

Fredriksson, K., Mäkinen, V. & Navarro, G., 2004, Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN 2004). Springer-Verlag, s. 39-48 (LNCS; vol. 2976).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

2003

Algorithms for Transposition Invariant String Matching

Mäkinen, V., Navarro, G. & Ukkonen, E., 2003, Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003): Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003). Springer-Verlag, s. 191-202 (LNCS; vol. 2607).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Approximate Matching of Run-length Compressed Strings

Mäkinen, V., Navarro, G. & Ukkonen, E., 2003, I : Algorithmica. 35, 4, s. 347–369

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Compact Suffix Array — A Space-efficient Full-text Index

Mäkinen, V., 2003, I : Fundamenta Informaticae. 56, 1-2, s. 191–210

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Geometric algorithms for transposition invariant content-based music retrieval

Ukkonen, E., Lemström, K. & Mäkinen, V., 2003, Proc. 4th International Conference on Music Information Retrieval. Hoos, H. & Bainbridge, D. (red.). s. 193-199

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Öppen tillgång
Fil

On Minimizing Pattern Splitting in Multi-track String Matching

Lemström, K. & Mäkinen, V., 2003, Unknown host publication. Springer-Verlag, s. 237-253 (LNCS; vol. 2676).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Sweepline the Music!

Ukkonen, E., Lemström, K. & Mäkinen, V., 2003, Computer Science in Perspective, Essays Dedicated to Thomas Ottmann. Springer-Verlag, s. 330-342 13 s. (LNCS; vol. 2598).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKapitelVetenskaplig

The C-BRAHMS Project

Lemström, K., Mäkinen, V., Pienimäki, A., Turkia, M. & Ukkonen, E., 2003, Proc. 4th International Conference on Music Information Retrieval. Hoos, H. & Bainbridge, D. (red.). s. 237-238

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Öppen tillgång
Fil
2002

Local Similarity Based Point-Pattern Matching

Mäkinen, V. & Ukkonen, E., 2002, Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002). Springer-Verlag, s. 115-132 (LNCS; vol. 2373).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

2001

Approximate Matching of Run-Length Compressed Strings

Mäkinen, V., Navarro, G. & Ukkonen, E., 2001, Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM 2001). Springer-Verlag, s. 31-49 (LNCS; vol. 2089).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Trade Off Between Compression and Search Times in Compact Suffix Array

Mäkinen, V., 2001, Proceedings of the Third International Workshop on Algorithm Engineering and Experimentation (ALENEX 2001). Springer-Verlag, s. 189-201 (LNCS; vol. 2153).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Using Edit Distance in Point-Pattern Matching

Mäkinen, V., 2001, Proceedings of the 8th International Symposium on String Processing and Information Retrieval (SPIRE 2001). IEEE Computer Society, s. 153-161

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

2000

Compact Suffix Array

Mäkinen, V., 2000, Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM 2000). Springer-Verlag, s. 305-319 (LNCS; vol. 1848).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review