default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJarno Alanko
Person information
- affiliation: University of Helsinki, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Mohammadali Serajian, Simone Marini, Jarno N. Alanko, Noelle R. Noyes, Mattia Prosperi, Christina Boucher:
Scalable de novo classification of antibiotic resistance of Mycobacterium tuberculosis. Bioinform. 40(Supplement_1): i39-i47 (2024)- [j9]Toni Hammarberg
, José M. Vallet Garcia, Jarno N. Alanko, Mohammad Zahidul H. Bhuiyan:
An Experimental Performance Assessment of Galileo OSNMA. Sensors 24(2): 404 (2024) - [c12]Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza:
Computing the LCP Array of a Labeled Graph. CPM 2024: 1:1-1:15 - [i8]Jarno Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza:
Computing the LCP Array of a Labeled Graph. CoRR abs/2404.14235 (2024) - 2023
- [j8]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Founder Graphs. Algorithmica 85(6): 1586-1623 (2023) - [j7]Sebastian S. Schmidt, Jarno N. Alanko:
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. Algorithms Mol. Biol. 18(1): 5 (2023) - [j6]Jarno N. Alanko, Jaakko Vuohtoniemi, Tommi Mäklin, Simon J. Puglisi:
Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes. Bioinform. 39(Supplement-1): 260-269 (2023) - [c11]Jarno N. Alanko, Simon J. Puglisi, Jaakko Vuohtoniemi:
Small Searchable κ-Spectra via Subset Rank Queries on the Spectral Burrows-Wheeler Transform. ACDA 2023: 225-236 - [c10]Toni Hammarberg, José M. Vallet Garcia, Jarno N. Alanko, Mohammad Zahidul H. Bhuiyan:
An Experimental Performance Assessment of Galileo OSNMA. ICL-GNSS 2023: 1-7 - [c9]Jarno N. Alanko, Elena Biagi, Simon J. Puglisi:
Longest Common Prefix Arrays for Succinct k-Spectra. SPIRE 2023: 1-13 - [c8]Jarno N. Alanko, Elena Biagi, Simon J. Puglisi, Jaakko Vuohtoniemi:
Subset Wavelet Trees. SEA 2023: 4:1-4:14 - [i7]Jarno N. Alanko, Elena Biagi, Simon J. Puglisi:
Longest Common Prefix Arrays for Succinct k-Spectra. CoRR abs/2306.04850 (2023) - 2022
- [j5]Jarno N. Alanko, Ilya B. Slizovskiy, Daniel Lokshtanov, Travis Gagie, Noelle R. Noyes, Christina Boucher:
Syotti: scalable bait design for DNA enrichment. Bioinform. 38(Supplement_1): i177-i184 (2022) - [c7]Jarno Alanko, Nicola Cotumaccio, Nicola Prezza:
Linear-time Minimization of Wheeler DFAs. DCC 2022: 53-62 - [c6]Sebastian S. Schmidt, Jarno N. Alanko:
Eulertigs: Minimum Plain Text Representation of k-mer Sets Without Repetitions in Linear Time. WABI 2022: 2:1-2:21 - 2021
- [j4]Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Wheeler languages. Inf. Comput. 281: 104820 (2021) - [c5]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Elastic Founder Graphs. ISAAC 2021: 20:1-20:18 - [i6]Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Founder Graphs. CoRR abs/2102.12822 (2021) - [i5]Jarno Alanko, Nicola Cotumaccio, Nicola Prezza:
Linear-time Minimization of Wheeler DFAs. CoRR abs/2111.02480 (2021) - 2020
- [b1]Jarno Alanko:
Space-Efficient Algorithms for Strings and Prefix-Sortable Graphs. University of Helsinki, Finland, 2020 - [j3]Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye:
Finding all maximal perfect haplotype blocks in linear time. Algorithms Mol. Biol. 15(1): 2 (2020) - [c4]Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Regular Languages meet Prefix Sorting. SODA 2020: 911-930 - [i4]Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Wheeler Languages. CoRR abs/2002.10303 (2020)
2010 – 2019
- 2019
- [j2]Fabio Cunial, Jarno Alanko, Djamal Belazzougui:
A framework for space-efficient variable-order Markov models. Bioinform. 35(22): 4607-4616 (2019) - [c3]Jarno N. Alanko, Travis Gagie, Gonzalo Navarro, Louisa Seelbach Benkner:
Tunneling on Wheeler Graphs. DCC 2019: 122-131 - [c2]Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye:
Finding All Maximal Perfect Haplotype Blocks in Linear Time. WABI 2019: 8:1-8:9 - [i3]Jarno Alanko, Alberto Policriti, Nicola Prezza:
On Prefix-Sorting Finite Automata. CoRR abs/1902.01088 (2019) - 2018
- [i2]Jarno Alanko, Travis Gagie, Gonzalo Navarro, Louisa Seelbach Benkner:
Tunneling on Wheeler Graphs. CoRR abs/1811.02457 (2018) - 2017
- [j1]Jarno Alanko, Fabio Cunial, Djamal Belazzougui, Veli Mäkinen:
A framework for space-efficient read clustering in metagenomic samples. BMC Bioinform. 18(S-3): 49-60 (2017) - [c1]Jarno Alanko, Tuukka Norri:
Greedy Shortest Common Superstring Approximation in Compact Space. SPIRE 2017: 1-13 - [i1]Jarno Alanko, Tuukka Norri:
Greedy Shortest Common Superstring Approximation in Compact Space. CoRR abs/1707.07727 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-13 01:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
