Jarno Alanko

Orcid: 0000-0002-8003-9225

Affiliations:
  • University of Helsinki, Finland


According to our database1, Jarno Alanko authored at least 19 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Experimental Performance Assessment of Galileo OSNMA.
Sensors, January, 2024

Computing the LCP Array of a Labeled Graph.
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time.
Algorithms Mol. Biol., December, 2023

Algorithms and Complexity on Indexing Founder Graphs.
Algorithmica, June, 2023

Themisto: a scalable colored <i>k</i>-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes.
Bioinform., 2023

Subset Wavelet Trees.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Longest Common Prefix Arrays for Succinct k-Spectra.
Proceedings of the String Processing and Information Retrieval, 2023

Small Searchable <i>κ</i>-Spectra via Subset Rank Queries on the Spectral Burrows-Wheeler Transform.
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022
Linear-time Minimization of Wheeler DFAs.
Proceedings of the Data Compression Conference, 2022

2021
Wheeler languages.
Inf. Comput., 2021

Algorithms and Complexity on Indexing Elastic Founder Graphs.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Space-Efficient Algorithms for Strings and Prefix-Sortable Graphs.
PhD thesis, 2020

Finding all maximal perfect haplotype blocks in linear time.
Algorithms Mol. Biol., 2020

Regular Languages meet Prefix Sorting.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
On Prefix-Sorting Finite Automata.
CoRR, 2019

A framework for space-efficient variable-order Markov models.
Bioinform., 2019

Tunneling on Wheeler Graphs.
Proceedings of the Data Compression Conference, 2019

2017
A framework for space-efficient read clustering in metagenomic samples.
BMC Bioinform., 2017

Greedy Shortest Common Superstring Approximation in Compact Space.
Proceedings of the String Processing and Information Retrieval, 2017


  Loading...