Demo Data from EDBT 2026 / reviewers in the wild / expert
Jaakko Vuohtoniemi
dblp:352/0531
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
genomics |
0.7 | 1 | 2023 | Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes · Bioinform. 2023 |
Bioinformatics and computational biology
metagenomics |
0.7 | 1 | 2023 | Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes · Bioinform. 2023 |
Bioinformatics and computational biology › sequence analysis › read mapping
pseudoalignment |
0.7 | 1 | 2023 | Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes · Bioinform. 2023 |
Bioinformatics and computational biology › sequence analysis
sequence indexing |
0.7 | 1 | 2023 | Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes · Bioinform. 2023 |
Algorithms and data structures › sequence algorithms
string algorithms |
0.2 | 1 | 2023 | Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes · Bioinform. 2023 |
Algorithms and data structures › space-efficient algorithms
succinct data structures |
0.2 | 1 | 2023 | Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes · Bioinform. 2023 |
Methods — techniques the papers use, named apart from their topics
pseudoalignment · 1.3k-mer indexing · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Subset Wavelet Trees
Jarno Alanko, Elena Biagi 0002, Simon J. Puglisi, Jaakko Vuohtoniemi |
SEA | 4 |
| 2023 | Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomesabstractMOTIVATION: Huge datasets containing whole-genome sequences of bacterial strains are now commonplace and represent a rich and important resource for modern genomic epidemiology and metagenomics. In order to efficiently make use of these datasets, efficient indexing data structures-that are both scalable and provide rapid query throughput-are paramount. RESULTS: Here, we present Themisto, a scalable colored k-mer index designed for large collections of microbial reference genomes, that works for both short and long read data. Themisto indexes 179 thousand Salmonella enterica genomes in 9 h. The resulting index takes 142 gigabytes. In comparison, the best competing tools Metagraph and Bifrost were only able to index 11 000 genomes in the same time. In pseudoalignment, these other tools were either an order of magnitude slower than Themisto, or used an order of magnitude more memory. Themisto also offers superior pseudoalignment quality, achieving a higher recall than previous methods on Nanopore read sets. AVAILABILITY AND IMPLEMENTATION: Themisto is available and documented as a C++ package at https://github.com/algbio/themisto available under the GPLv2 license. Jarno Alanko, Jaakko Vuohtoniemi, Tommi Mäklin, Simon J. Puglisi |
Bioinform. | 2 |