Jarno Niklas Alanko
Title
Cited by
Cited by
Year
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
9*2020
Tunneling on wheeler graphs
J Alanko, T Gagie, G Navarro, LS Benkner
2019 Data Compression Conference (DCC), 122-131, 2019
72019
Greedy shortest common superstring approximation in compact space
J Alanko, T Norri
International Symposium on String Processing and Information Retrieval, 1-13, 2017
72017
A framework for space-efficient read clustering in metagenomic samples
J Alanko, F Cunial, D Belazzougui, V Mäkinen
BMC bioinformatics 18 (3), 59, 2017
62017
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), 2, 2020
32020
Wheeler languages
J Alanko, G D'Agostino, A Policriti, N Prezza
arXiv preprint arXiv:2002.10303, 2020
32020
Genomic Epidemiology with Mixed Samples
T Mäklin, T Kallonen, J Alanko, V Mäkinen, J Corander, A Honkela
BioRxiv, 2020
22020
A framework for space-efficient variable-order Markov models
F Cunial, J Alanko, D Belazzougui
Bioinformatics 35 (22), 4607-4616, 2019
12019
Space-Efficient Algorithms for Strings and Prefix-Sortable Graphs
J Alanko
Helsingin yliopisto, 2020
2020
Pseudoalignment in the mGEMS pipeline
T Mäklin, T Kallonen, J Alanko, V Mäkinen, J Corander, A Honkela
Supplementary material for:“A framework for space-efficient variable-order Markov models”
F Cunial, J Alanko, D Belazzougui
The system can't perform the operation now. Try again later.
Articles 1–11