Greedy Shortest Common Superstring Approximation in Compact Space. - Jarno Alanko; Tuukka Norri (SPIRE, 2017)

A framework for space-efficient read clustering in metagenomic samples. - Jarno Alanko; Fabio Cunial; Djamal Belazzougui; Veli Mäkinen (BMC Bioinform., 2017)

Tunneling on Wheeler Graphs. - Jarno N. Alanko; Travis Gagie; Gonzalo Navarro 001; Louisa Seelbach Benkner (DCC, 2019)

A framework for space-efficient variable-order Markov models. - Fabio Cunial; Jarno Alanko; Djamal Belazzougui (Bioinform., 2019)

On Prefix-Sorting Finite Automata. - Jarno Alanko; Alberto Policriti; Nicola Prezza (CoRR, 2019)

Regular Languages meet Prefix Sorting. - Jarno Alanko; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (SODA, 2020)

Finding all maximal perfect haplotype blocks in linear time. - Jarno Alanko; Hideo Bannai; Bastien Cazaux; Pierre Peterlongo; Jens Stoye (Algorithms Mol. Biol., 2020)

Space-Efficient Algorithms for Strings and Prefix-Sortable Graphs. - Jarno Alanko (2020)

Algorithms and Complexity on Indexing Elastic Founder Graphs. - Massimo Equi; Tuukka Norri; Jarno Alanko; Bastien Cazaux; Alexandru I. Tomescu; Veli Mäkinen (ISAAC, 2021)

Wheeler languages. - Jarno Alanko; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (Inf. Comput., 2021)

Linear-time Minimization of Wheeler DFAs. - Jarno Alanko; Nicola Cotumaccio; Nicola Prezza (DCC, 2022)

Syotti: scalable bait design for DNA enrichment. - Jarno N. Alanko; Ilya B. Slizovskiy; Daniel Lokshtanov; Travis Gagie; Noelle R. Noyes; Christina Boucher 001 (Bioinform., 2022)

Small Searchable κ-Spectra via Subset Rank Queries on the Spectral Burrows-Wheeler Transform. - Jarno N. Alanko; Simon J. Puglisi; Jaakko Vuohtoniemi (ACDA, 2023)

Longest Common Prefix Arrays for Succinct k-Spectra. - Jarno N. Alanko; Elena Biagi 002; Simon J. Puglisi (SPIRE, 2023)

Subset Wavelet Trees. - Jarno N. Alanko; Elena Biagi 002; Simon J. Puglisi; Jaakko Vuohtoniemi (SEA, 2023)

Themisto: a scalable colored k-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)

Algorithms and Complexity on Indexing Founder Graphs. - Massimo Equi; Tuukka Norri; Jarno Alanko; Bastien Cazaux; Alexandru I. Tomescu; Veli Mäkinen (Algorithmica, 2023)

Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. - Sebastian S. Schmidt; Jarno N. Alanko (Algorithms Mol. Biol., 2023)

Computing the LCP Array of a Labeled Graph. - Jarno N. Alanko; Davide Cenzato; Nicola Cotumaccio; Sung-Hwan Kim; Giovanni Manzini; Nicola Prezza (CPM, 2024)

Scalable de novo classification of antibiotic resistance of Mycobacterium tuberculosis. - Mohammadali Serajian; Simone Marini; Jarno N. Alanko; Noelle R. Noyes; Mattia Prosperi; Christina Boucher 001 (Bioinform., 2024)

An Experimental Performance Assessment of Galileo OSNMA. - Toni Hammarberg; José M. Vallet Garcia; Jarno N. Alanko; Mohammad Zahidul H. Bhuiyan (Sensors, 2024)

Graph Indexing Beyond Wheeler Graphs. - Jarno N. Alanko; Elena Biagi 002; Massimo Equi; Veli Mäkinen; Simon J. Puglisi; Nicola Rizzo 001; Kunihiko Sadakane; Jouni Sirén (The Expanding World of Compressed Data, 2025)

Compact Data Structures for Collections of Sets. - Jarno N. Alanko; Philip Bille; Inge Li Gørtz; Gonzalo Navarro 001; Simon J. Puglisi (From Strings to Graphs, and Back Again, 2025)

The Trie Measure, Revisited. - Jarno N. Alanko; Ruben Becker; Davide Cenzato; Travis Gagie; Sung-Hwan Kim; Bojana Kodric; Nicola Prezza (CPM, 2025)