| Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes JN Alanko, J Vuohtoniemi, T Mäklin, SJ Puglisi Bioinformatics 39 (Supplement_1), i260-i269, 2023 | 45 | 2023 |
| Regular languages meet prefix sorting J Alanko, G D'Agostino, A Policriti, N Prezza Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 43 | 2020 |
| Bacterial genomic epidemiology with mixed samples T Mäklin, T Kallonen, J Alanko, Ø Samuelsen, K Hegstad, V Mäkinen, ... Microbial genomics 7 (11), 000691, 2021 | 36* | 2021 |
| Wheeler languages J Alanko, G D'Agostino, A Policriti, N Prezza Information and Computation 281, 104820, 2021 | 32 | 2021 |
| Small Searchable κ-Spectra via Subset Rank Queries on the Spectral Burrows-Wheeler Transform JN Alanko, SJ Puglisi, J Vuohtoniemi SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23 …, 2023 | 28* | 2023 |
| Tunneling on wheeler graphs J Alanko, T Gagie, G Navarro, LS Benkner 2019 Data Compression Conference (DCC), 122-131, 2019 | 23 | 2019 |
| Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time S Schmidt, JN Alanko Algorithms for Molecular Biology 18 (1), 5, 2023 | 18 | 2023 |
| Finding all maximal perfect haplotype blocks in linear time J Alanko, H Bannai, B Cazaux, P Peterlongo, J Stoye Algorithms for Molecular Biology 15, 1-7, 2020 | 18 | 2020 |
| Matchtigs: minimum plain text representation of k-mer sets S Schmidt, S Khan, JN Alanko, GE Pibiri, AI Tomescu Genome Biology 24 (1), 136, 2023 | 17 | 2023 |
| Algorithms and complexity on indexing elastic founder graphs M Equi, T Norri, J Alanko, B Cazaux, A Tomescu, V Mäkinen 32nd International Symposium on Algorithms and Computation (ISAAC 2021), 2021 | 15* | 2021 |
| Buffering updates enables efficient dynamic de bruijn graphs J Alanko, B Alipanahi, J Settle, C Boucher, T Gagie Computational and structural biotechnology journal 19, 4067-4078, 2021 | 14 | 2021 |
| Syotti: scalable bait design for DNA enrichment JN Alanko, IB Slizovskiy, D Lokshtanov, T Gagie, NR Noyes, C Boucher Bioinformatics 38 (Supplement_1), i177-i184, 2022 | 13 | 2022 |
| A framework for space-efficient read clustering in metagenomic samples J Alanko, F Cunial, D Belazzougui, V Mäkinen BMC bioinformatics 18, 49-60, 2017 | 12 | 2017 |
| A framework for space-efficient variable-order Markov models F Cunial, J Alanko, D Belazzougui Bioinformatics 35 (22), 4607-4616, 2019 | 11 | 2019 |
| An Experimental Performance Assessment of Galileo OSNMA T Hammarberg, JMV García, JN Alanko, MZH Bhuiyan Sensors 24 (2), 404, 2024 | 9 | 2024 |
| Greedy shortest common superstring approximation in compact space J Alanko, T Norri International Symposium on String Processing and Information Retrieval, 1-13, 2017 | 9 | 2017 |
| FGI-OSNMA: An Open Source Implementation of Galileo’s Open Service Navigation Message Authentication T Hammarberg, JMV García, JN Alanko, MZH Bhuiyan Proceedings of the 36th International Technical Meeting of the Satellite …, 2023 | 7 | 2023 |
| Subset wavelet trees JN Alanko, E Biagi, SJ Puglisi, J Vuohtoniemi 21st International Symposium on Experimental Algorithms (SEA 2023), 4: 1-4: 14, 2023 | 6 | 2023 |
| Linear-time minimization of wheeler DFAs J Alanko, N Cotumaccio, N Prezza 2022 Data Compression Conference (DCC), 53-62, 2022 | 5 | 2022 |
| Longest Common Prefix Arrays for Succinct k-Spectra JN Alanko, E Biagi, SJ Puglisi International Symposium on String Processing and Information Retrieval, 1-13, 2023 | 4 | 2023 |
Nicola PrezzaCa' Foscari University of VenicePreverjeni e-poštni naslov na unive.it