Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVeli Mäkinen
Person information
- affiliation: University of Helsinki
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j53]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
:
Algorithms and Complexity on Indexing Founder Graphs. Algorithmica 85(6): 1586-1623 (2023)- [j52]Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi:
On the Complexity of String Matching for Graphs. ACM Trans. Algorithms 19(3): 21:1-21:25 (2023) - [c62]Massimo Equi, Arianne Meijer-van de Griend, Veli Mäkinen:
From Bit-Parallelism to Quantum String Matching for Labelled Graphs. CPM 2023: 9:1-9:20 - [c61]Nicola Rizzo, Manuel Cáceres, Veli Mäkinen:
Finding Maximal Exact Matches in Graphs. WABI 2023: 10:1-10:17 - [i27]Nicola Rizzo, Manuel Cáceres, Veli Mäkinen:
Chaining of Maximal Exact Matches in Graphs. CoRR abs/2302.01748 (2023) - [i26]Nicola Rizzo, Massimo Equi, Tuukka Norri, Veli Mäkinen:
Elastic Founder Graphs Improved and Enhanced. CoRR abs/2303.05336 (2023) - [i25]Nicola Rizzo, Manuel Cáceres, Veli Mäkinen:
Finding Maximal Exact Matches in Graphs. CoRR abs/2305.09752 (2023) - 2022
- [c60]Nicola Rizzo, Veli Mäkinen:
Indexable Elastic Founder Graphs of Minimum Height. CPM 2022: 19:1-19:19 - [c59]Nicola Rizzo, Veli Mäkinen:
Linear Time Construction of Indexable Elastic Founder Graphs. IWOCA 2022: 480-493 - [i24]Nicola Rizzo, Veli Mäkinen:
Linear Time Construction of Indexable Elastic Founder Graphs. CoRR abs/2201.06492 (2022) - 2021
- [j51]Tuukka Norri, Bastien Cazaux, Saska Dönges, Daniel Valenzuela, Veli Mäkinen:
Founder reconstruction enables scalable and seamless pangenomic analysis. Bioinform. 37(24): 4611-4619 (2021) - [j50]Kristoffer Sahlin, Veli Mäkinen:
Accurate spliced alignment of long RNA sequencing reads. Bioinform. 37(24): 4643-4651 (2021) - [c58]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Elastic Founder Graphs. ISAAC 2021: 20:1-20:18 - [c57]Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu:
Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails. SOFSEM 2021: 608-622 - [i23]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Founder Graphs. CoRR abs/2102.12822 (2021) - 2020
- [j49]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen:
Linear-time String Indexing and Analysis in Small Space. ACM Trans. Algorithms 16(2): 17:1-17:54 (2020) - [c56]Altti Ilari Maarala, Ossi Arasalo, Daniel Valenzuela, Keijo Heljanko, Veli Mäkinen:
Scalable Reference Genome Assembly from Compressed Pan-Genome Index with Spark. BigData 2020: 68-84 - [c55]Veli Mäkinen, Kristoffer Sahlin:
Chaining with Overlaps Revisited. CPM 2020: 25:1-25:12 - [c54]Dustin Cobas, Veli Mäkinen, Massimiliano Rossi:
Tailoring r-index for Document Listing Towards Metagenomics Applications. SPIRE 2020: 291-306 - [c53]Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu:
Linear Time Construction of Indexable Founder Block Graphs. WABI 2020: 7:1-7:18 - [i22]Veli Mäkinen, Kristoffer Sahlin:
Chaining with overlaps revisited. CoRR abs/2001.06864 (2020) - [i21]Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu:
Conditional Indexing Lower Bounds Through Self-Reducibility. CoRR abs/2002.00629 (2020) - [i20]Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu:
Linear Time Construction of Indexable Founder Block Graphs. CoRR abs/2005.09342 (2020) - [i19]Dustin Cobas, Veli Mäkinen, Massimiliano Rossi:
Tailoring r-index for metagenomics. CoRR abs/2006.05871 (2020)
2010 – 2019
- 2019
- [j48]Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen:
Linear time minimum segmentation enables scalable founder reconstruction. Algorithms Mol. Biol. 14(1): 12:1-12:15 (2019) - [j47]Edin Husic, Xinyue Li, Ademir Hujdurovic, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanic, Alexandru I. Tomescu:
MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. Bioinform. 35(5): 769-777 (2019) - [j46]Mikko Rautiainen, Veli Mäkinen, Tobias Marschall:
Bit-parallel sequence-to-graph alignment. Bioinform. 35(19): 3599-3607 (2019) - [j45]Veli Mäkinen, Tuukka Norri:
Applying the Positional Burrows-Wheeler Transform to all-pairs Hamming distance. Inf. Process. Lett. 146: 17-19 (2019) - [j44]Veli Mäkinen, Alexandru I. Tomescu, Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi:
Sparse Dynamic Programming on DAGs with Small Width. ACM Trans. Algorithms 15(2): 29:1-29:21 (2019) - [j43]Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Alexandru I. Tomescu, Daniel Valenzuela:
Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics. IEEE ACM Trans. Comput. Biol. Bioinform. 16(1): 23-30 (2019) - [c52]Massimo Equi, Roberto Grossi, Veli Mäkinen, Alexandru I. Tomescu:
On the Complexity of String Matching for Graphs. ICALP 2019: 55:1-55:15 - [c51]Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri:
Linear Time Maximum Segmentation Problems in Column Stream Model. SPIRE 2019: 322-336 - [i18]Massimo Equi, Roberto Grossi, Veli Mäkinen:
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree. CoRR abs/1901.05264 (2019) - [i17]Massimo Equi, Roberto Grossi, Alexandru I. Tomescu, Veli Mäkinen:
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching. CoRR abs/1902.03560 (2019) - 2018
- [j42]Nidia Obscura Acosta, Veli Mäkinen, Alexandru I. Tomescu:
A safe and complete algorithm for metagenomic assembly. Algorithms Mol. Biol. 13(1): 3:1-3:12 (2018) - [j41]Anna Kuosmanen, Tuukka Norri, Veli Mäkinen:
Evaluating approaches to find exon chains based on long reads. Briefings Bioinform. 19(3): 404-414 (2018) - [j40]Daniel Valenzuela, Tuukka Norri, Niko Välimäki, Esa Pitkänen, Veli Mäkinen:
Towards pan-genome read alignment to improve variation calling. BMC Genom. 19(S2) (2018) - [j39]Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi:
Bidirectional Variable-Order de Bruijn Graphs. Int. J. Found. Comput. Sci. 29(8): 1279-1295 (2018) - [j38]Veli Mäkinen, Simon J. Puglisi:
Editorial: Special Issue on "Combinatorial Algorithms" (IWOCA 2016). Theory Comput. Syst. 62(6): 1349-1350 (2018) - [c50]Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi, Alexandru I. Tomescu, Veli Mäkinen:
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended. RECOMB 2018: 105-121 - [c49]Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen:
Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time. WABI 2018: 15:1-15:15 - [i16]Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen:
Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time. CoRR abs/1805.03574 (2018) - [i15]Diego Díaz-Domínguez, Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Gonzalo Navarro, Simon J. Puglisi:
Assembling Omnitigs using Hidden-Order de Bruijn Graphs. CoRR abs/1805.05228 (2018) - 2017
- [j37]Jarno Alanko, Fabio Cunial, Djamal Belazzougui, Veli Mäkinen:
A framework for space-efficient read clustering in metagenomic samples. BMC Bioinform. 18(S-3): 49-60 (2017) - [j36]Veli Mäkinen, Valeria Staneva, Alexandru I. Tomescu, Daniel Valenzuela, Sebastian Wilzbach:
Interval scheduling maximizing minimum coverage. Discret. Appl. Math. 225: 130-135 (2017) - [i14]Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi, Alexandru I. Tomescu, Veli Mäkinen:
Speeding up Dynamic Programming on DAGs through a Fast Approximation of Path Cover. CoRR abs/1705.08754 (2017) - 2016
- [j35]Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, Alexandru I. Tomescu:
Gap Filling as Exact Path Length Problem. J. Comput. Biol. 23(5): 347-361 (2016) - [c48]Mikko Rautiainen, Leena Salmela, Veli Mäkinen:
Identification of Variant Compositions in Related Strains Without Reference. AlCoB 2016: 158-170 - [c47]Anna Kuosmanen, Ahmed Sobih, Romeo Rizzi, Veli Mäkinen, Alexandru I. Tomescu:
On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy. BIOINFORMATICS 2016: 272-277 - [c46]Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi:
Bidirectional Variable-Order de Bruijn Graphs. LATIN 2016: 164-178 - [c45]Ahmed Sobih, Alexandru I. Tomescu, Veli Mäkinen:
MetaFlow: Metagenomic Profiling Based on Whole-Genome Coverage Analysis with Min-Cost Flows. RECOMB 2016: 111-121 - [c44]Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali:
Fully Dynamic de Bruijn Graphs. SPIRE 2016: 145-152 - [e1]Veli Mäkinen, Simon J. Puglisi, Leena Salmela:
Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings. Lecture Notes in Computer Science 9843, Springer 2016, ISBN 978-3-319-44542-7 [contents] - [r6]Djamal Belazzougui, Veli Mäkinen, Daniel Valenzuela:
Compressed Suffix Array. Encyclopedia of Algorithms 2016: 386-390 - [r5]Veli Mäkinen, Gonzalo Navarro:
Compressed Text Indexing. Encyclopedia of Algorithms 2016: 394-397 - [r4]Veli Mäkinen, Esko Ukkonen:
Point Pattern Matching. Encyclopedia of Algorithms 2016: 1589-1592 - [i13]Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali:
Fully Dynamic de Bruijn Graphs. CoRR abs/1607.04909 (2016) - [i12]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen:
Linear-time string indexing and analysis in small space. CoRR abs/1609.06378 (2016) - [i11]Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Daniel Valenzuela:
Diploid Alignment is NP-hard. CoRR abs/1611.05086 (2016) - 2015
- [b1]Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu:
Genome-Scale Algorithm Design: Biological Sequence Analysis in the Era of High-Throughput Sequencing. Cambridge University Press 2015, ISBN 9781107078536 - [j34]Karen E. van Rens, Veli Mäkinen, Alexandru I. Tomescu:
SNV-PPILP: refined SNV calling for tumor data using perfect phylogenies and ILP. Bioinform. 31(7): 1133-1135 (2015) - [j33]Roland Wittler, Tobias Marschall, Alexander Schönhuth, Veli Mäkinen:
Repeat- and error-aware comparison of deletions. Bioinform. 31(18): 2947-2954 (2015) - [j32]Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki:
Fast in-memory XPath search using compressed indexes. Softw. Pract. Exp. 45(3): 399-434 (2015) - [j31]Alexandru I. Tomescu, Travis Gagie, Alexandru Popa, Romeo Rizzi, Anna Kuosmanen, Veli Mäkinen:
Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly. IEEE ACM Trans. Comput. Biol. Bioinform. 12(6): 1345-1354 (2015) - [c43]Veli Mäkinen, Daniel Valenzuela:
Diploid Alignments and Haplotyping. ISBRA 2015: 235-246 - [c42]Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, Alexandru I. Tomescu:
Gap Filling as Exact Path Length Problem. RECOMB 2015: 281-292 - [i10]Veli Mäkinen, Valeria Staneva, Alexandru I. Tomescu, Daniel Valenzuela:
Interval scheduling maximizing minimum coverage. CoRR abs/1508.07820 (2015) - 2014
- [j30]Veli Mäkinen:
Editorial: Special Issue on Algorithms for Sequence Analysis and Storage. Algorithms 7(1): 186-187 (2014) - [j29]Romeo Rizzi, Alexandru I. Tomescu, Veli Mäkinen:
On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly. BMC Bioinform. 15(S-9): S5 (2014) - [j28]Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki:
Multi-pattern matching with bidirectional indexes. J. Discrete Algorithms 24: 26-39 (2014) - [j27]Veli Mäkinen, Niko Välimäki, Jouni Sirén:
Indexing Graphs for Path Queries with Applications in Genome Research. IEEE ACM Trans. Comput. Biol. Bioinform. 11(2): 375-388 (2014) - [i9]Sebastian Böcker, Gunnar W. Klau, Veli Mäkinen, Hon Wai Leong:
Towards the ground truth: Exact algorithms for bioinformatics research (NII Shonan Meeting 2014-2). NII Shonan Meet. Rep. 2014 (2014) - 2013
- [j26]Veli Mäkinen, Jani Rahkola:
Haploid to diploid alignment for variation calling assessment. BMC Bioinform. 14(S-15): S13 (2013) - [j25]Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen:
A novel min-cost flow method for estimating transcript expression with RNA-Seq. BMC Bioinform. 14(S-5): S15 (2013) - [c41]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen:
Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform. ESA 2013: 133-144 - [c40]Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen:
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. WABI 2013: 85-98 - [i8]Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen:
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. CoRR abs/1307.7811 (2013) - 2012
- [j24]Veli Mäkinen, Leena Salmela, Johannes Ylinen:
Normalized N50 assembly metric using gap-restricted co-linear chaining. BMC Bioinform. 13: 255 (2012) - [j23]Niko Välimäki, Susana Ladra, Veli Mäkinen:
Approximate all-pairs suffix/prefix overlaps. Inf. Comput. 213: 49-58 (2012) - [c39]Markus Heinonen, Niko Välimäki, Veli Mäkinen, Juho Rousu:
Efficient Path Kernels for Reaction Function Prediction. BIOINFORMATICS 2012: 202-207 - [c38]Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki:
Multi-pattern Matching with Bidirectional Indexes. COCOON 2012: 384-395 - [c37]Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki:
Forbidden Patterns. LATIN 2012: 327-337 - [c36]Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela, Jorma Tarhio:
Indexed Multi-pattern Matching. LATIN 2012: 399-407 - 2011
- [j22]Leena Salmela, Veli Mäkinen, Niko Välimäki, Johannes Ylinen, Esko Ukkonen:
Fast scaffolding with small independent mixed integer programs. Bioinform. 27(23): 3259-3265 (2011) - [j21]Petteri Kaski, Veli Mäkinen, Patric R. J. Östergård:
The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected. Graphs Comb. 27(4): 539-546 (2011) - [j20]Stanislav Angelov, Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen:
Missing pattern discovery. J. Discrete Algorithms 9(2): 153-165 (2011) - [c35]Jouni Sirén, Niko Välimäki, Veli Mäkinen:
Indexing Finite Language Representation of Population Genotypes. WABI 2011: 270-281 - 2010
- [j19]Kjell Lemström, Niko Mikkilä, Veli Mäkinen:
Filtering methods for content-based retrieval on indexed symbolic music databases. Inf. Retr. 13(1): 1-21 (2010) - [j18]Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, Niko Välimäki:
Storage and Retrieval of Highly Repetitive Sequence Collections. J. Comput. Biol. 17(3): 281-308 (2010) - [c34]Veli Mäkinen, Niko Välimäki, Antti Laaksonen, Riku Katainen:
Unified View of Backward Backtracking in Short Read Mapping. Algorithms and Applications 2010: 182-195 - [c33]Niko Välimäki, Susana Ladra, Veli Mäkinen:
Approximate All-Pairs Suffix/Prefix Overlaps. CPM 2010: 76-87 - [c32]Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki:
Fast in-memory XPath search using compressed indexes. ICDE 2010: 417-428 - [i7]Jouni Sirén, Niko Välimäki, Veli Mäkinen:
Indexing Finite Language Representation of Population Genotypes. CoRR abs/1010.2656 (2010) - [i6]Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela:
Pattern Kits. CoRR abs/1011.3491 (2010)
2000 – 2009
- 2009
- [j17]Niko Välimäki, Veli Mäkinen, Wolfgang Gerlach, Kashyap Dixit:
Engineering a compressed suffix tree implementation. ACM J. Exp. Algorithmics 14 (2009) - [j16]François Nicolas, Veli Mäkinen, Esko Ukkonen:
Efficient construction of maximal and minimal representations of motifs of a string. Theor. Comput. Sci. 410(30-32): 2999-3005 (2009) - [j15]Johannes Fischer, Veli Mäkinen, Gonzalo Navarro:
Faster entropy-bounded compressed suffix trees. Theor. Comput. Sci. 410(51): 5354-5364 (2009) - [c31]Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, Niko Välimäki:
Storage and Retrieval of Individual Genomes. RECOMB 2009: 121-137 - [i5]Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki:
Fast In-Memory XPath Search over Compressed Text and Tree Indexes. CoRR abs/0907.2089 (2009) - 2008
- [j14]Veli Mäkinen, Gonzalo Navarro:
Dynamic entropy-compressed sequences and full-text indexes. ACM Trans. Algorithms 4(3): 32:1-32:38 (2008) - [j13]Sebastian Böcker, Veli Mäkinen:
Combinatorial Approaches for Mass Spectra Recalibration. IEEE ACM Trans. Comput. Biol. Bioinform. 5(1): 91-100 (2008) - [c30]Johannes Fischer, Veli Mäkinen, Gonzalo Navarro:
An(other) Entropy-Bounded Compressed Suffix Tree. CPM 2008: 152-165 - [c29]Veli Mäkinen, Gonzalo Navarro:
On Self-Indexing Images - Image Compression with Added Value. DCC 2008: 422-431 - [c28]Johannes Fischer, Veli Mäkinen, Niko Välimäki:
Space Efficient String Mining under Frequency Constraints. ICDM 2008: 193-202 - [c27]Kjell Lemström, Niko Mikkilä, Veli Mäkinen:
Fast Index Based Filters for Music Retrieval. ISMIR 2008: 677-682 - [c26]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 - [r3]Veli Mäkinen:
Compressed Suffix Array. Encyclopedia of Algorithms 2008 - [r2]Veli Mäkinen, Gonzalo Navarro:
Compressed Text Indexing. Encyclopedia of Algorithms 2008 - [r1]Veli Mäkinen, Esko Ukkonen:
Point Pattern Matching. Encyclopedia of Algorithms 2008 - [i4]Angela Bonifati, Gregory Leighton, Veli Mäkinen, Sebastian Maneth, Gonzalo Navarro, Andrea Pugliese:
An In-Memory XQuery/XPath Engine over a Compressed Structured Text Representation. Structure-Based Compression of Complex Massive Data 2008 - [i3]Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, Niko Välimäki:
Storage and Retrieval of Individual Genomes. Structure-Based Compression of Complex Massive Data 2008 - 2007
- [j12]Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen:
Compressed suffix tree - a basis for genome-scale sequence analysis. Bioinform. 23(5): 629-630 (2007) - [j11]Gonzalo Navarro, Veli Mäkinen:
Compressed full-text indexes. ACM Comput. Surv. 39(1): 2 (2007) - [j10]Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro:
Rotation and lighting invariant template matching. Inf. Comput. 205(7): 1096-1113 (2007) - [j9]Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro:
Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3(2): 20 (2007) - [j8]Veli Mäkinen, Gonzalo Navarro:
Rank and select revisited and extended. Theor. Comput. Sci. 387(3): 332-347 (2007) - [c25]Niko Välimäki, Veli Mäkinen:
Space-Efficient Algorithms for Document Retrieval. CPM 2007: 205-215 - [c24]Veli Mäkinen, Gonzalo Navarro:
Implicit Compression Boosting with Applications to Self-indexing. SPIRE 2007: 229-241 - [c23]Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen:
Engineering a Compressed Suffix Tree Implementation. WEA 2007: 217-228 - 2006
- [j7]Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro:
Flexible Music Retrieval in Sublinear Time. Int. J. Found. Comput. Sci. 17(6): 1345-1364 (2006) - [j6]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) - [c22]Veli Mäkinen, Gonzalo Navarro:
Dynamic Entropy-Compressed Sequences and Full-Text Indexes. CPM 2006: 306-317 - [c21]