2008 |
46 | EE | Johannes Fischer,
Veli Mäkinen,
Gonzalo Navarro:
An(other) Entropy-Bounded Compressed Suffix Tree.
CPM 2008: 152-165 |
45 | EE | Veli Mäkinen,
Gonzalo Navarro:
On Self-Indexing Images - Image Compression with Added Value.
DCC 2008: 422-431 |
44 | EE | Johannes Fischer,
Veli Mäkinen,
Niko Välimäki:
Space Efficient String Mining under Frequency Constraints.
ICDM 2008: 193-202 |
43 | EE | Jouni Sirén,
Niko Välimäki,
Veli Mäkinen,
Gonzalo Navarro:
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections.
SPIRE 2008: 164-175 |
42 | EE | Veli Mäkinen:
Compressed Suffix Array.
Encyclopedia of Algorithms 2008 |
41 | EE | Veli Mäkinen,
Gonzalo Navarro:
Compressed Text Indexing.
Encyclopedia of Algorithms 2008 |
40 | EE | Veli Mäkinen,
Esko Ukkonen:
Point Pattern Matching.
Encyclopedia of Algorithms 2008 |
39 | EE | Veli Mäkinen,
Gonzalo Navarro:
Dynamic entropy-compressed sequences and full-text indexes.
ACM Transactions on Algorithms 4(3): (2008) |
38 | EE | Sebastian Böcker,
Veli Mäkinen:
Combinatorial Approaches for Mass Spectra Recalibration.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(1): 91-100 (2008) |
2007 |
37 | EE | Niko Välimäki,
Veli Mäkinen:
Space-Efficient Algorithms for Document Retrieval.
CPM 2007: 205-215 |
36 | EE | Veli Mäkinen,
Gonzalo Navarro:
Implicit Compression Boosting with Applications to Self-indexing.
SPIRE 2007: 229-241 |
35 | EE | Niko Välimäki,
Wolfgang Gerlach,
Kashyap Dixit,
Veli Mäkinen:
Engineering a Compressed Suffix Tree Implementation.
WEA 2007: 217-228 |
34 | EE | Gonzalo Navarro,
Veli Mäkinen:
Compressed full-text indexes.
ACM Comput. Surv. 39(1): (2007) |
33 | EE | Paolo Ferragina,
Giovanni Manzini,
Veli Mäkinen,
Gonzalo Navarro:
Compressed representations of sequences and full-text indexes.
ACM Transactions on Algorithms 3(2): (2007) |
32 | EE | Niko Välimäki,
Wolfgang Gerlach,
Kashyap Dixit,
Veli Mäkinen:
Compressed suffix tree - a basis for genome-scale sequence analysis.
Bioinformatics 23(5): 629-630 (2007) |
31 | EE | Kimmo Fredriksson,
Veli Mäkinen,
Gonzalo Navarro:
Rotation and lighting invariant template matching.
Inf. Comput. 205(7): 1096-1113 (2007) |
30 | EE | Veli Mäkinen,
Gonzalo Navarro:
Rank and select revisited and extended.
Theor. Comput. Sci. 387(3): 332-347 (2007) |
2006 |
29 | EE | Veli Mäkinen,
Gonzalo Navarro:
Dynamic Entropy-Compressed Sequences and Full-Text Indexes.
CPM 2006: 306-317 |
28 | EE | Veli Mäkinen,
Gonzalo Navarro:
Position-Restricted Substring Searching.
LATIN 2006: 703-714 |
27 | EE | Kimmo Fredriksson,
Veli Mäkinen,
Gonzalo Navarro:
Flexible Music Retrieval in Sublinear Time.
Int. J. Found. Comput. Sci. 17(6): 1345-1364 (2006) |
26 | EE | Szymon Grabowski,
Gonzalo Navarro,
Rafal Przywarski,
Alejandro Salinger,
Veli Mäkinen:
A Simple Alphabet-independent Fm-index.
Int. J. Found. Comput. Sci. 17(6): 1365-1384 (2006) |
2005 |
25 | EE | Veli Mäkinen,
Gonzalo Navarro:
Succinct Suffix Arrays Based on Run-Length Encoding.
CPM 2005: 45-56 |
24 | EE | Sebastian Böcker,
Veli Mäkinen:
Combinatorial Approaches for Mass Spectra Recalibration.
Computational Proteomics 2005 |
23 | | Kimmo Fredriksson,
Veli Mäkinen,
Gonzalo Navarro:
Flexible music retrieval in sublinear time.
Stringology 2005: 174-189 |
22 | | Szymon Grabowski,
Veli Mäkinen,
Gonzalo Navarro,
Alejandro Salinger:
A simple alphabet-independent FM-index.
Stringology 2005: 231-245 |
21 | EE | Veli Mäkinen,
Gonzalo Navarro,
Esko Ukkonen:
Transposition invariant string matching.
J. Algorithms 56(2): 124-153 (2005) |
20 | EE | Kjell Lemström,
Veli Mäkinen:
On minimizing pattern splitting in multi-track string matching.
J. Discrete Algorithms 3(2-4): 248-266 (2005) |
19 | | Veli Mäkinen,
Gonzalo Navarro:
Succinct Suffix Arrays based on Run-Length Encoding.
Nord. J. Comput. 12(1): 40-66 (2005) |
2004 |
18 | EE | Veli Mäkinen,
Gonzalo Navarro:
Compressed Compact Suffix Arrays.
CPM 2004: 420-433 |
17 | EE | Veli Mäkinen,
Gonzalo Navarro,
Kunihiko Sadakane:
Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays.
ISAAC 2004: 681-692 |
16 | EE | Kimmo Fredriksson,
Veli Mäkinen,
Gonzalo Navarro:
Rotation and Lighting Invariant Template Matching.
LATIN 2004: 39-48 |
15 | EE | Paolo Ferragina,
Giovanni Manzini,
Veli Mäkinen,
Gonzalo Navarro:
An Alphabet-Friendly FM-Index.
SPIRE 2004: 150-160 |
14 | EE | Szymon Grabowski,
Veli Mäkinen,
Gonzalo Navarro:
First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index.
SPIRE 2004: 210-211 |
13 | EE | Shunsuke Inenaga,
Teemu Kivioja,
Veli Mäkinen:
Finding Missing Patterns.
WABI 2004: 463-474 |
2003 |
12 | EE | Kjell Lemström,
Veli Mäkinen:
On Minimizing Pattern Splitting in Multi-track String Matching.
CPM 2003: 237-253 |
11 | EE | Esko Ukkonen,
Kjell Lemström,
Veli Mäkinen:
Sweepline the Music!
Computer Science in Perspective 2003: 330-342 |
10 | EE | Esko Ukkonen,
Kjell Lemström,
Veli Mäkinen:
Geometric algorithms for transposition invariant content based music retrieval.
ISMIR 2003 |
9 | EE | Kjell Lemström,
Veli Mäkinen,
Anna Pienimäki,
M. Turkia,
Esko Ukkonen:
The C-BRAHMS project.
ISMIR 2003 |
8 | EE | Veli Mäkinen,
Gonzalo Navarro,
Esko Ukkonen:
Algorithms for Transposition Invariant String Matching.
STACS 2003: 191-202 |
7 | EE | Veli Mäkinen,
Esko Ukkonen,
Gonzalo Navarro:
Approximate Matching of Run-Length Compressed Strings.
Algorithmica 35(4): 347-369 (2003) |
6 | EE | Veli Mäkinen:
Compact Suffix Array -- A Space-Efficient Full-Text Index.
Fundam. Inform. 56(1-2): 191-210 (2003) |
2002 |
5 | EE | Veli Mäkinen,
Esko Ukkonen:
Local Similarity Based Point-Pattern Matching.
CPM 2002: 115-132 |
2001 |
4 | EE | Veli Mäkinen:
Trade Off Between Compression and Search Times in Compact Suffix Array.
ALENEX 2001: 189-201 |
3 | EE | Veli Mäkinen,
Gonzalo Navarro,
Esko Ukkonen:
Approximate Matching of Run-Length Compressed Strings.
CPM 2001: 31-49 |
2 | | Veli Mäkinen:
Using Edit Distance in Point-Pattern Matching.
SPIRE 2001: 153-161 |
2000 |
1 | EE | Veli Mäkinen:
Compact Suffix Array.
CPM 2000: 305-319 |