Jarno Alanko

According to our database, Jarno Alanko authored at least 18 papers between 2017 and 2024.

Collaborative distances:

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

2024

An Experimental Performance Assessment of Galileo OSNMA.

Toni Hammarberg, José M. Vallet Garcia, Jarno N. Alanko, Mohammad Zahidul H. Bhuiyan

Sensors, January, 2024

2023

Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time.

Sebastian S. Schmidt, Jarno N. Alanko

Algorithms Mol. Biol., December, 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

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

Jarno N. Alanko, Jaakko Vuohtoniemi, Tommi Mäklin, Simon J. Puglisi

Bioinform., 2023

Subset Wavelet Trees.

Jarno N. Alanko, Elena Biagi, Simon J. Puglisi, Jaakko Vuohtoniemi

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Longest Common Prefix Arrays for Succinct k-Spectra.

Jarno N. Alanko, Elena Biagi, Simon J. Puglisi

Proceedings of the String Processing and Information Retrieval, 2023

Small Searchable <i>κ</i>-Spectra via Subset Rank Queries on the Spectral Burrows-Wheeler Transform.

Jarno N. Alanko, Simon J. Puglisi, Jaakko Vuohtoniemi

Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022

Linear-time Minimization of Wheeler DFAs.

Jarno Alanko, Nicola Cotumaccio, Nicola Prezza

Proceedings of the Data Compression Conference, 2022

2021

Wheeler languages.

Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza

Inf. Comput., 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

Space-Efficient Algorithms for Strings and Prefix-Sortable Graphs.

Jarno Alanko

PhD thesis, 2020

Finding all maximal perfect haplotype blocks in linear time.

Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye

Algorithms Mol. Biol., 2020

Regular Languages meet Prefix Sorting.

Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

On Prefix-Sorting Finite Automata.

Jarno Alanko, Alberto Policriti, Nicola Prezza

CoRR, 2019

A framework for space-efficient variable-order Markov models.

Fabio Cunial, Jarno Alanko, Djamal Belazzougui

Bioinform., 2019

Tunneling on Wheeler Graphs.

Jarno N. Alanko, Travis Gagie, Gonzalo Navarro, Louisa Seelbach Benkner

Proceedings of the Data Compression Conference, 2019

2017

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

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

BMC Bioinform., 2017

Greedy Shortest Common Superstring Approximation in Compact Space.

Jarno Alanko, Tuukka Norri

Proceedings of the String Processing and Information Retrieval, 2017