Veli Mäkinen

According to our database, Veli Mäkinen authored at least 127 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Finding maximal exact matches in graphs.

Nicola Rizzo, Manuel Cáceres, Veli Mäkinen

Algorithms Mol. Biol., December, 2024

Elastic founder graphs improved and enhanced.

Nicola Rizzo, Massimo Equi, Tuukka Norri, Veli Mäkinen

Theor. Comput. Sci., January, 2024

2023

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails.

Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu

Theor. Comput. Sci., October, 2023

Chaining for accurate alignment of erroneous long reads to acyclic variation graphs.

Jun Ma, Manuel Cáceres, Leena Salmela, Veli Mäkinen, Alexandru I. Tomescu

Bioinform., August, 2023

On the Complexity of String Matching for Graphs.

Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi

ACM Trans. Algorithms, July, 2023

Algorithms and Complexity on Indexing Founder Graphs.

Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen

Algorithmica, June, 2023

Chaining of Maximal Exact Matches in Graphs.

Nicola Rizzo, Manuel Cáceres, Veli Mäkinen

Proceedings of the String Processing and Information Retrieval, 2023

From Bit-Parallelism to Quantum String Matching for Labelled Graphs.

Massimo Equi, Arianne Meijer-van de Griend, Veli Mäkinen

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Genome-Scale Algorithm Design: Bioinformatics in the Era of High-Throughput Sequencing (2nd edition).

Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu

Cambridge University Press, ISBN: 9781009341233, 2023

2022

Linear Time Construction of Indexable Elastic Founder Graphs.

Nicola Rizzo, Veli Mäkinen

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Indexable Elastic Founder Graphs of Minimum Height.

Nicola Rizzo, Veli Mäkinen

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Accurate spliced alignment of long RNA sequencing reads.

Kristoffer Sahlin, Veli Mäkinen

Bioinform., 2021

Founder reconstruction enables scalable and seamless pangenomic analysis.

Tuukka Norri, Bastien Cazaux, Saska Dönges, Daniel Valenzuela, Veli Mäkinen

Bioinform., 2021

Algorithms and Complexity on Indexing Elastic Founder Graphs.

Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Linear-time String Indexing and Analysis in Small Space.

Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen

ACM Trans. Algorithms, 2020

Tailoring r-index for metagenomics.

Dustin Cobas, Veli Mäkinen, Massimiliano Rossi

CoRR, 2020

Conditional Indexing Lower Bounds Through Self-Reducibility.

Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu

CoRR, 2020

Linear Time Construction of Indexable Founder Block Graphs.

Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu

Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

Tailoring r-index for Document Listing Towards Metagenomics Applications.

Dustin Cobas, Veli Mäkinen, Massimiliano Rossi

Proceedings of the String Processing and Information Retrieval, 2020

Chaining with Overlaps Revisited.

Veli Mäkinen, Kristoffer Sahlin

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Scalable Reference Genome Assembly from Compressed Pan-Genome Index with Spark.

Altti Ilari Maarala, Ossi Arasalo, Daniel Valenzuela, Keijo Heljanko, Veli Mäkinen

Proceedings of the Big Data - BigData 2020, 2020

2019

Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics.

Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Alexandru I. Tomescu, Daniel Valenzuela

IEEE ACM Trans. Comput. Biol. Bioinform., 2019

Sparse Dynamic Programming on DAGs with Small Width.

Veli Mäkinen, Alexandru I. Tomescu, Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi

ACM Trans. Algorithms, 2019

Applying the Positional Burrows-Wheeler Transform to all-pairs Hamming distance.

Veli Mäkinen, Tuukka Norri

Inf. Process. Lett., 2019

On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching.

Massimo Equi, Roberto Grossi, Alexandru I. Tomescu, Veli Mäkinen

CoRR, 2019

On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree.

Massimo Equi, Roberto Grossi, Veli Mäkinen

CoRR, 2019

Bit-parallel sequence-to-graph alignment.

Mikko Rautiainen, Veli Mäkinen, Tobias Marschall

Bioinform., 2019

MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP.

Edin Husic, Xinyue Li, Ademir Hujdurovic, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanic, Alexandru I. Tomescu

Bioinform., 2019

Linear time minimum segmentation enables scalable founder reconstruction.

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

Algorithms Mol. Biol., 2019

Linear Time Maximum Segmentation Problems in Column Stream Model.

Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri

Proceedings of the String Processing and Information Retrieval, 2019

2018

Editorial: Special Issue on "Combinatorial Algorithms" (IWOCA 2016).

Veli Mäkinen, Simon J. Puglisi

Theory Comput. Syst., 2018

Bidirectional Variable-Order de Bruijn Graphs.

Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi

Int. J. Found. Comput. Sci., 2018

Assembling Omnitigs using Hidden-Order de Bruijn Graphs.

Diego Díaz-Domínguez, Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Gonzalo Navarro, Simon J. Puglisi

CoRR, 2018

Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time.

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

CoRR, 2018

Towards pan-genome read alignment to improve variation calling.

Daniel Valenzuela, Tuukka Norri, Niko Välimäki, Esa Pitkänen, Veli Mäkinen

BMC Genom., 2018

Evaluating approaches to find exon chains based on long reads.

Anna Kuosmanen, Tuukka Norri, Veli Mäkinen

Briefings Bioinform., 2018

A safe and complete algorithm for metagenomic assembly.

Nidia Obscura Acosta, Veli Mäkinen, Alexandru I. Tomescu

Algorithms Mol. Biol., 2018

Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time.

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended.

Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi, Alexandru I. Tomescu, Veli Mäkinen

Proceedings of the Research in Computational Molecular Biology, 2018

2017

Interval scheduling maximizing minimum coverage.

Veli Mäkinen, Valeria Staneva, Alexandru I. Tomescu, Daniel Valenzuela, Sebastian Wilzbach

Discret. Appl. Math., 2017

Speeding up Dynamic Programming on DAGs through a Fast Approximation of Path Cover.

Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi, Alexandru I. Tomescu, Veli Mäkinen

CoRR, 2017

A framework for space-efficient read clustering in metagenomic samples.

Jarno Alanko, Fabio Cunial, Djamal Belazzougui, Veli Mäkinen

BMC Bioinform., 2017

2016

Point Pattern Matching.

Veli Mäkinen, Esko Ukkonen

Encyclopedia of Algorithms, 2016

Compressed Text Indexing.

Veli Mäkinen, Gonzalo Navarro

Encyclopedia of Algorithms, 2016

Compressed Suffix Array.

Djamal Belazzougui, Veli Mäkinen, Daniel Valenzuela

Encyclopedia of Algorithms, 2016

Gap Filling as Exact Path Length Problem.

Leena Salmela, Kristoffer Sahlin, Veli Mäkinen, Alexandru I. Tomescu

J. Comput. Biol., 2016

Diploid Alignment is NP-hard.

Romeo Rizzi, Massimo Cairo, Veli Mäkinen, Daniel Valenzuela

CoRR, 2016

Fully Dynamic de Bruijn Graphs.

Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali

Proceedings of the String Processing and Information Retrieval, 2016

MetaFlow: Metagenomic Profiling Based on Whole-Genome Coverage Analysis with Min-Cost Flows.

Ahmed Sobih, Alexandru I. Tomescu, Veli Mäkinen

Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy.

Anna Kuosmanen, Ahmed Sobih, Romeo Rizzi, Veli Mäkinen, Alexandru I. Tomescu

Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2016), 2016

Identification of Variant Compositions in Related Strains Without Reference.

Mikko Rautiainen, Leena Salmela, Veli Mäkinen

Proceedings of the Algorithms for Computational Biology - Third International Conference, 2016

2015

Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly.

Alexandru I. Tomescu, Travis Gagie, Alexandru Popa, Romeo Rizzi, Anna Kuosmanen, Veli Mäkinen

IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Fast in-memory XPath search using compressed indexes.

Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki

Softw. Pract. Exp., 2015

Interval scheduling maximizing minimum coverage.

Veli Mäkinen, Valeria Staneva, Alexandru I. Tomescu, Daniel Valenzuela

CoRR, 2015

Repeat- and error-aware comparison of deletions.

Roland Wittler, Tobias Marschall, Alexander Schönhuth, Veli Mäkinen

Bioinform., 2015

SNV-PPILP: refined SNV calling for tumor data using perfect phylogenies and ILP.

Karen E. van Rens, Veli Mäkinen, Alexandru I. Tomescu

Bioinform., 2015

Diploid Alignments and Haplotyping.

Veli Mäkinen, Daniel Valenzuela

Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

Genome-Scale Algorithm Design: Biological Sequence Analysis in the Era of High-Throughput Sequencing.

Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu

Cambridge University Press, ISBN: 9781107078536, 2015

2014

Indexing Graphs for Path Queries with Applications in Genome Research.

Veli Mäkinen, Niko Välimäki, Jouni Sirén

IEEE ACM Trans. Comput. Biol. Bioinform., 2014

Towards the ground truth: Exact algorithms for bioinformatics research (NII Shonan Meeting 2014-2).

Sebastian Böcker, Gunnar W. Klau, Veli Mäkinen, Hon Wai Leong

NII Shonan Meet. Rep., 2014

Multi-pattern matching with bidirectional indexes.

Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki

J. Discrete Algorithms, 2014

On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly.

Romeo Rizzi, Alexandru I. Tomescu, Veli Mäkinen

BMC Bioinform., 2014

Editorial: Special Issue on Algorithms for Sequence Analysis and Storage.

Veli Mäkinen

Algorithms, 2014

2013

A novel min-cost flow method for estimating transcript expression with RNA-Seq.

Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen

BMC Bioinform., 2013

Haploid to diploid alignment for variation calling assessment.

Veli Mäkinen, Jani Rahkola

BMC Bioinform., 2013

A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths.

Alexandru I. Tomescu, Anna Kuosmanen, Romeo Rizzi, Veli Mäkinen

Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform.

Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen

Proceedings of the Algorithms - ESA 2013, 2013

2012

Approximate all-pairs suffix/prefix overlaps.

Niko Välimäki, Susana Ladra, Veli Mäkinen

Inf. Comput., 2012

Normalized N50 assembly metric using gap-restricted co-linear chaining.

Veli Mäkinen, Leena Salmela, Johannes Ylinen

BMC Bioinform., 2012

Indexed Multi-pattern Matching.

Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela, Jorma Tarhio

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Forbidden Patterns.

Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Efficient Path Kernels for Reaction Function Prediction.

Markus Heinonen, Niko Välimäki, Veli Mäkinen, Juho Rousu

Proceedings of the BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms, Vilamoura, Algarve, Portugal, 1, 2012

2011

Missing pattern discovery.

Stanislav Angelov, Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen

J. Discrete Algorithms, 2011

The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected.

Petteri Kaski, Veli Mäkinen, Patric R. J. Östergård

Graphs Comb., 2011

Fast scaffolding with small independent mixed integer programs.

Leena Salmela, Veli Mäkinen, Niko Välimäki, Johannes Ylinen, Esko Ukkonen

Bioinform., 2011

Indexing Finite Language Representation of Population Genotypes.

Jouni Sirén, Niko Välimäki, Veli Mäkinen

Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

2010

Storage and Retrieval of Highly Repetitive Sequence Collections.

Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, Niko Välimäki

J. Comput. Biol., 2010

Filtering methods for content-based retrieval on indexed symbolic music databases.

Kjell Lemström, Niko Mikkilä, Veli Mäkinen

Inf. Retr., 2010

Pattern Kits

Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela

CoRR, 2010

Unified View of Backward Backtracking in Short Read Mapping.

Veli Mäkinen, Niko Välimäki, Antti Laaksonen, Riku Katainen

Proceedings of the Algorithms and Applications, 2010

2009

Efficient construction of maximal and minimal representations of motifs of a string.

François Nicolas, Veli Mäkinen, Esko Ukkonen

Theor. Comput. Sci., 2009

Faster entropy-bounded compressed suffix trees.

Johannes Fischer, Veli Mäkinen, Gonzalo Navarro

Theor. Comput. Sci., 2009

Engineering a compressed suffix tree implementation.

Niko Välimäki, Veli Mäkinen, Wolfgang Gerlach, Kashyap Dixit

ACM J. Exp. Algorithmics, 2009

Fast In-Memory XPath Search over Compressed Text and Tree Indexes

Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki

CoRR, 2009

Storage and Retrieval of Individual Genomes.

Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, Niko Välimäki

Proceedings of the Research in Computational Molecular Biology, 2009

2008

Point Pattern Matching.

Veli Mäkinen, Esko Ukkonen

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Compressed Text Indexing.

Veli Mäkinen, Gonzalo Navarro

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Compressed Suffix Array.

Veli Mäkinen

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Combinatorial Approaches for Mass Spectra Recalibration.

Sebastian Böcker, Veli Mäkinen

IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Dynamic entropy-compressed sequences and full-text indexes.

Veli Mäkinen, Gonzalo Navarro

ACM Trans. Algorithms, 2008

Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections.

Jouni Sirén, Niko Välimäki, Veli Mäkinen, Gonzalo Navarro

Proceedings of the String Processing and Information Retrieval, 2008

Fast Index Based Filters for Music Retrieval.

Kjell Lemström, Niko Mikkilä, Veli Mäkinen

Proceedings of the ISMIR 2008, 2008

Space Efficient String Mining under Frequency Constraints.

Johannes Fischer, Veli Mäkinen, Niko Välimäki

Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

On Self-Indexing Images - Image Compression with Added Value.

Veli Mäkinen, Gonzalo Navarro

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

An In-Memory XQuery/XPath Engine over a Compressed Structured Text Representation.

Angela Bonifati, Gregory Leighton, Veli Mäkinen, Sebastian Maneth, Gonzalo Navarro, Andrea Pugliese

Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

An(other) Entropy-Bounded Compressed Suffix Tree.

Johannes Fischer, Veli Mäkinen, Gonzalo Navarro

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

Rank and select revisited and extended.

Veli Mäkinen, Gonzalo Navarro

Theor. Comput. Sci., 2007

Compressed representations of sequences and full-text indexes.

Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro

ACM Trans. Algorithms, 2007

Rotation and lighting invariant template matching.

Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro

Inf. Comput., 2007

Compressed full-text indexes.

Gonzalo Navarro, Veli Mäkinen

ACM Comput. Surv., 2007

Compressed suffix tree - a basis for genome-scale sequence analysis.

Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen

Bioinform., 2007

Implicit Compression Boosting with Applications to Self-indexing.

Veli Mäkinen, Gonzalo Navarro

Proceedings of the String Processing and Information Retrieval, 2007

Space-Efficient Algorithms for Document Retrieval.

Niko Välimäki, Veli Mäkinen

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

A Simple Alphabet-independent Fm-index.

Szymon Grabowski, Gonzalo Navarro, Rafal Przywarski, Alejandro Salinger, Veli Mäkinen

Int. J. Found. Comput. Sci., 2006

Flexible Music Retrieval in Sublinear Time.

Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro

Int. J. Found. Comput. Sci., 2006

Position-Restricted Substring Searching.

Veli Mäkinen, Gonzalo Navarro

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Succinct Suffix Arrays based on Run-Length Encoding.

Veli Mäkinen, Gonzalo Navarro

Nord. J. Comput., 2005

On minimizing pattern splitting in multi-track string matching.

Kjell Lemström, Veli Mäkinen

J. Discrete Algorithms, 2005

Transposition invariant string matching.

Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen

J. Algorithms, 2005

A simple alphabet-independent FM-index.

Szymon Grabowski, Veli Mäkinen, Gonzalo Navarro, Alejandro Salinger

Proceedings of the Prague Stringology Conference, 2005

Maximum line-pair stabbing problem and its variations.

Sebastian Böcker, Veli Mäkinen

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004

Finding Missing Patterns.

Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

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

Szymon Grabowski, Veli Mäkinen, Gonzalo Navarro

Proceedings of the String Processing and Information Retrieval, 2004

An Alphabet-Friendly FM-Index.

Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro

Proceedings of the String Processing and Information Retrieval, 2004

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

Veli Mäkinen, Gonzalo Navarro, Kunihiko Sadakane

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Compressed Compact Suffix Arrays.

Veli Mäkinen, Gonzalo Navarro

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

Compact Suffix Array - A Space-Efficient Full-Text Index.

Veli Mäkinen

Fundam. Informaticae, 2003

Approximate Matching of Run-Length Compressed Strings.

Veli Mäkinen, Esko Ukkonen, Gonzalo Navarro

Algorithmica, 2003

Matching Numeric Strings under Noise.

Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen

Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003

Algorithms for Transposition Invariant String Matching.

Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Geometric algorithms for transposition invariant content based music retrieval.

Esko Ukkonen, Kjell Lemström, Veli Mäkinen

Proceedings of the ISMIR 2003, 2003

The C-BRAHMS project.

Kjell Lemström, Veli Mäkinen, Anna Pienimäki, Mika Turkia, Esko Ukkonen

Proceedings of the ISMIR 2003, 2003

Sweepline the Music!

Esko Ukkonen, Kjell Lemström, Veli Mäkinen

Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002

Local Similarity Based Point-Pattern Matching.

Veli Mäkinen, Esko Ukkonen

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

Using Edit Distance in Point-Pattern Matching.

Veli Mäkinen

Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

Trade Off Between Compression and Search Times in Compact Suffix Array.

Veli Mäkinen

Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000

Compact Suffix Array.

Veli Mäkinen

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000