Veli Mäkinen

5.3k total citations
78 papers, 1.7k citations indexed

About

Veli Mäkinen is a scholar working on Artificial Intelligence, Molecular Biology and Hardware and Architecture. According to data from OpenAlex, Veli Mäkinen has authored 78 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Artificial Intelligence, 48 papers in Molecular Biology and 16 papers in Hardware and Architecture. Recurrent topics in Veli Mäkinen's work include Algorithms and Data Compression (52 papers), Genomics and Phylogenetic Studies (35 papers) and Network Packet Processing and Optimization (15 papers). Veli Mäkinen is often cited by papers focused on Algorithms and Data Compression (52 papers), Genomics and Phylogenetic Studies (35 papers) and Network Packet Processing and Optimization (15 papers). Veli Mäkinen collaborates with scholars based in Finland, Chile and Italy. Veli Mäkinen's co-authors include Gonzalo Navarro, Niko Välimäki, Jouni Sirén, Alexandru I. Tomescu, Esko Ukkonen, Giovanni Manzini, Paolo Ferragina, Roméo Rizzi, Kjell Lemström and Anna Kuosmanen and has published in prestigious journals such as Bioinformatics, PLoS ONE and Nature Protocols.

In The Last Decade

Veli Mäkinen

76 papers receiving 1.6k citations

Peers

Veli Mäkinen
Costas S. Iliopoulos United Kingdom
Veli Mäkinen
Citations per year, relative to Veli Mäkinen Veli Mäkinen (= 1×) peers Costas S. Iliopoulos

Countries citing papers authored by Veli Mäkinen

Since Specialization
Citations

This map shows the geographic impact of Veli Mäkinen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Veli Mäkinen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Veli Mäkinen more than expected).

Fields of papers citing papers by Veli Mäkinen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Veli Mäkinen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Veli Mäkinen. The network helps show where Veli Mäkinen may publish in the future.

Co-authorship network of co-authors of Veli Mäkinen

This figure shows the co-authorship network connecting the top 25 collaborators of Veli Mäkinen. A scholar is included among the top collaborators of Veli Mäkinen based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Veli Mäkinen. Veli Mäkinen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Sahlin, Kristoffer & Veli Mäkinen. (2021). Accurate spliced alignment of long RNA sequencing reads. Bioinformatics. 37(24). 4643–4651. 23 indexed citations
2.
Mäkinen, Veli & Kristoffer Sahlin. (2020). Chaining with overlaps revisited. arXiv (Cornell University). 2 indexed citations
3.
Mäkinen, Veli, et al.. (2020). Linear Time Construction of Indexable Founder Block Graphs. arXiv (Cornell University). 4 indexed citations
4.
Rautiainen, Mikko, Veli Mäkinen, & Tobias Marschall. (2019). Bit-parallel sequence-to-graph alignment. Bioinformatics. 35(19). 3599–3607. 34 indexed citations
5.
Grossi, Roberto, et al.. (2019). On the Complexity of String Matching for Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 11 indexed citations
6.
Grossi, Roberto, et al.. (2019). On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
7.
Valenzuela, Daniel, et al.. (2018). Towards pan-genome read alignment to improve variation calling. BMC Genomics. 19(S2). 87–87. 20 indexed citations
8.
Katainen, Riku, Iikki Donner, Tatiana Cajuso, et al.. (2018). Discovery of potential causative mutations in human coding and noncoding genome with the interactive software BasePlayer. Nature Protocols. 13(11). 2580–2600. 29 indexed citations
9.
Mäkinen, Veli, et al.. (2018). A safe and complete algorithm for metagenomic assembly. Algorithms for Molecular Biology. 13(1). 3–3. 5 indexed citations
10.
Salmela, Leena, et al.. (2017). Variant genotyping with gap filling. PLoS ONE. 12(9). e0184608–e0184608. 2 indexed citations
11.
Kuosmanen, Anna, et al.. (2016). Evaluating approaches to find exon chains based on long reads. Briefings in Bioinformatics. 19(3). bbw137–bbw137. 9 indexed citations
12.
Gog, Simon, et al.. (2013). Multi-pattern matching with bidirectional indexes ☆ ☆Preliminary version of this article appeared in COCOON 2012 [12].. Journal of Discrete Algorithms. 24. 26–39. 1 indexed citations
13.
Välimäki, Niko, Susana Ladra, & Veli Mäkinen. (2012). Approximate all-pairs suffix/prefix overlaps. Information and Computation. 213. 49–58. 6 indexed citations
14.
Lemström, Kjell, et al.. (2008). FAST INDEX BASED FILTERS FOR MUSIC RETRIEVAL. International Symposium/Conference on Music Information Retrieval. 677–682. 2 indexed citations
15.
Fredriksson, Kimmo, Veli Mäkinen, & Gonzalo Navarro. (2007). Rotation and lighting invariant template matching. Information and Computation. 205(7). 1096–1113. 10 indexed citations
16.
Grabowski, Szymon, et al.. (2005). A simple alphabet-independent FM-index.. Universidad de Chile. 231–245. 2 indexed citations
17.
Böcker, Sebastian & Veli Mäkinen. (2005). Maximum Line-Pair Stabbing Problem and its Variations ∗. 183–186. 1 indexed citations
18.
Mäkinen, Veli, et al.. (2003). Algorithms for Transposition Invariant String Matching. 191–202. 13 indexed citations
19.
Mäkinen, Veli. (2002). Compact Suffix Array — A Space-Efficient Full-Text Index. Fundamenta Informaticae. 56(1). 191–210. 19 indexed citations
20.
Mäkinen, Veli & Esko Ukkonen. (2002). Local similarity based point-pattern matching. Lecture notes in computer science. 2373. 115–132. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026