Veli Mäkinen

About Veli Mäkinen

Veli Mäkinen, With an exceptional h-index of 39 and a recent h-index of 23 (since 2020), a distinguished researcher at Helsingin yliopisto, specializes in the field of Algorithms, data structures, bioinformatics, data compression, #UnivHelsinkiCS.

His recent articles reflect a diverse array of research interests and contributions to the field:

Finding maximal exact matches in graphs

Elastic founder graphs improved and enhanced

Tackling reference bias in genotyping by using founder sequences with PanVC 3

Genome-Scale Algorithm Design: Bioinformatics in the Era of High-Throughput Sequencing

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

Chaining of maximal exact matches in graphs

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

Algorithms and complexity on indexing founder graphs

Veli Mäkinen Information

University

Position

Professor of Computer Science

Citations(all)

6724

Citations(since 2020)

2325

Cited By

5410

hIndex(all)

39

hIndex(since 2020)

23

i10Index(all)

88

i10Index(since 2020)

50

Email

University Profile Page

Google Scholar

Veli Mäkinen Skills & Research Interests

Algorithms

data structures

bioinformatics

data compression

#UnivHelsinkiCS

Top articles of Veli Mäkinen

Finding maximal exact matches in graphs

Algorithms for Molecular Biology

2024/3/11

Elastic founder graphs improved and enhanced

Theoretical Computer Science

2024/1/8

Nicola Rizzo
Nicola Rizzo

H-Index: 0

Veli Mäkinen
Veli Mäkinen

H-Index: 23

Tackling reference bias in genotyping by using founder sequences with PanVC 3

Bioinformatics advances

2024/1/1

Veli Mäkinen
Veli Mäkinen

H-Index: 23

Genome-Scale Algorithm Design: Bioinformatics in the Era of High-Throughput Sequencing

2023/10/12

Veli Mäkinen
Veli Mäkinen

H-Index: 23

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

Theoretical Computer Science

2023/10/9

Veli Mäkinen
Veli Mäkinen

H-Index: 23

Chaining of maximal exact matches in graphs

2023/9/20

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

Bioinformatics

2023/8/1

Algorithms and complexity on indexing founder graphs

Algorithmica

2023/6

Veli Mäkinen
Veli Mäkinen

H-Index: 23

On the complexity of string matching for graphs

ACM Transactions on Algorithms

2023/4/12

Veli Mäkinen
Veli Mäkinen

H-Index: 23

From Bit-Parallelism to Quantum String Matching for Labelled Graphs

arXiv preprint arXiv:2302.02848

2023/2/6

Veli Mäkinen
Veli Mäkinen

H-Index: 23

Linear time construction of indexable elastic founder graphs

2022/5/29

Nicola Rizzo
Nicola Rizzo

H-Index: 0

Veli Mäkinen
Veli Mäkinen

H-Index: 23

Indexable elastic founder graphs of minimum height

2022

Nicola Rizzo
Nicola Rizzo

H-Index: 0

Veli Mäkinen
Veli Mäkinen

H-Index: 23

Graphchainer: Colinear chaining for accurate alignment of long reads to variation graphs

bioRxiv

2022

Accurate spliced alignment of long RNA sequencing reads

Bioinformatics

2021/12/31

Kristoffer Sahlin
Kristoffer Sahlin

H-Index: 8

Veli Mäkinen
Veli Mäkinen

H-Index: 23

Bacterial genomic epidemiology with mixed samples

Microbial Genomics

2021/11/15

Distributed hybrid-indexing of compressed pan-genomes for scalable and fast sequence alignment

Plos one

2021/8/3

Algorithms and complexity on indexing elastic founder graphs

2021

Veli Mäkinen
Veli Mäkinen

H-Index: 23

Quantum linear algorithm for edit distance using the word qram model

arXiv preprint arXiv:2112.13005

2021/12/24

Veli Mäkinen
Veli Mäkinen

H-Index: 23

Founder reconstruction enables scalable and seamless pangenomic analysis

Bioinformatics

2021/12/15

Veli Mäkinen
Veli Mäkinen

H-Index: 23

See List of Professors in Veli Mäkinen University(Helsingin yliopisto)

Co-Authors

academic-engine